./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:24:23,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:24:23,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:24:23,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:24:23,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:24:23,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:24:23,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:24:23,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:24:23,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:24:23,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:24:23,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:24:23,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:24:23,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:24:23,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:24:23,966 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:24:23,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:24:23,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:24:23,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:24:23,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:24:23,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:24:23,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:24:23,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:24:23,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:24:23,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:24:23,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:24:23,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:24:23,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:24:23,970 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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2025-01-10 00:24:24,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:24:24,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:24:24,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:24:24,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:24:24,276 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:24:24,278 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_test2-1.i [2025-01-10 00:24:25,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b62fe7908/c5649c5f638143c4b857ed0562c06612/FLAGe5f52d2f2 [2025-01-10 00:24:25,948 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:24:25,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2025-01-10 00:24:25,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b62fe7908/c5649c5f638143c4b857ed0562c06612/FLAGe5f52d2f2 [2025-01-10 00:24:25,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b62fe7908/c5649c5f638143c4b857ed0562c06612 [2025-01-10 00:24:25,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:24:25,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:24:25,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:24:25,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:24:25,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:24:25,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:24:25" (1/1) ... [2025-01-10 00:24:25,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f4f890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:25, skipping insertion in model container [2025-01-10 00:24:25,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:24:25" (1/1) ... [2025-01-10 00:24:26,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:24:26,443 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,475 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,478 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,482 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,490 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,517 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,517 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,521 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,522 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:26,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:24:26,552 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:24:26,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:24:26,706 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:24:26,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26 WrapperNode [2025-01-10 00:24:26,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:24:26,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:24:26,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:24:26,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:24:26,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,802 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1274 [2025-01-10 00:24:26,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:24:26,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:24:26,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:24:26,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:24:26,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,898 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-01-10 00:24:26,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:24:26,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:24:26,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:24:26,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:24:26,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (1/1) ... [2025-01-10 00:24:26,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:24:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:27,016 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-01-10 00:24:27,021 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-01-10 00:24:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:24:27,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:24:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:24:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:24:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:24:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:24:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:24:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:24:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:24:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:24:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:24:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:24:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:24:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:24:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:24:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:24:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:24:27,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:24:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:24:27,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:24:27,262 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:24:27,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:24:27,286 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:24:27,316 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:24:27,332 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:24:29,428 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-01-10 00:24:29,428 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:24:29,472 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:24:29,476 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 00:24:29,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:24:29 BoogieIcfgContainer [2025-01-10 00:24:29,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:24:29,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:24:29,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:24:29,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:24:29,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:24:25" (1/3) ... [2025-01-10 00:24:29,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6454369e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:24:29, skipping insertion in model container [2025-01-10 00:24:29,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:26" (2/3) ... [2025-01-10 00:24:29,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6454369e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:24:29, skipping insertion in model container [2025-01-10 00:24:29,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:24:29" (3/3) ... [2025-01-10 00:24:29,487 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2025-01-10 00:24:29,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:24:29,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test2-1.i that has 6 procedures, 1084 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-01-10 00:24:29,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:24:29,603 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;@69d8cfb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:24:29,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-01-10 00:24:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 1074 states, 639 states have (on average 2.0093896713615025) internal successors, (1284), 1067 states have internal predecessors, (1284), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 00:24:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:24:29,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:29,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:24:29,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:29,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2025-01-10 00:24:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767749671] [2025-01-10 00:24:29,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:29,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:24:29,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:24:29,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:29,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:29,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767749671] [2025-01-10 00:24:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767749671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:29,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:24:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182696109] [2025-01-10 00:24:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:29,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:29,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:29,865 INFO L87 Difference]: Start difference. First operand has 1074 states, 639 states have (on average 2.0093896713615025) internal successors, (1284), 1067 states have internal predecessors, (1284), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:30,574 INFO L93 Difference]: Finished difference Result 1060 states and 1234 transitions. [2025-01-10 00:24:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:24:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:30,601 INFO L225 Difference]: With dead ends: 1060 [2025-01-10 00:24:30,601 INFO L226 Difference]: Without dead ends: 1058 [2025-01-10 00:24:30,603 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-01-10 00:24:30,606 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1099 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:30,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 897 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:24:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-01-10 00:24:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-01-10 00:24:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 641 states have (on average 1.8939157566302651) internal successors, (1214), 1051 states have internal predecessors, (1214), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1232 transitions. [2025-01-10 00:24:30,720 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1232 transitions. Word has length 3 [2025-01-10 00:24:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1232 transitions. [2025-01-10 00:24:30,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1232 transitions. [2025-01-10 00:24:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:24:30,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:30,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:24:30,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:24:30,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2025-01-10 00:24:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028308459] [2025-01-10 00:24:30,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:24:30,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:24:30,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:30,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:30,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:30,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028308459] [2025-01-10 00:24:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028308459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:30,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:24:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490077859] [2025-01-10 00:24:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:30,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:30,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:30,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:30,847 INFO L87 Difference]: Start difference. First operand 1058 states and 1232 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:31,548 INFO L93 Difference]: Finished difference Result 1377 states and 1639 transitions. [2025-01-10 00:24:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:24:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:31,554 INFO L225 Difference]: With dead ends: 1377 [2025-01-10 00:24:31,554 INFO L226 Difference]: Without dead ends: 1377 [2025-01-10 00:24:31,554 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-01-10 00:24:31,555 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 396 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:31,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1922 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:24:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-01-10 00:24:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1288. [2025-01-10 00:24:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 867 states have (on average 1.8546712802768166) internal successors, (1608), 1281 states have internal predecessors, (1608), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:24:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1636 transitions. [2025-01-10 00:24:31,585 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1636 transitions. Word has length 3 [2025-01-10 00:24:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:31,585 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1636 transitions. [2025-01-10 00:24:31,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1636 transitions. [2025-01-10 00:24:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 00:24:31,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:31,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:31,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:24:31,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1329215633, now seen corresponding path program 1 times [2025-01-10 00:24:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939275074] [2025-01-10 00:24:31,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:31,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:24:31,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:24:31,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939275074] [2025-01-10 00:24:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939275074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:31,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862421547] [2025-01-10 00:24:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:31,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:24:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:31,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:24:31,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:31,844 INFO L87 Difference]: Start difference. First operand 1288 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-01-10 00:24:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:32,988 INFO L93 Difference]: Finished difference Result 1366 states and 1627 transitions. [2025-01-10 00:24:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-01-10 00:24:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:32,996 INFO L225 Difference]: With dead ends: 1366 [2025-01-10 00:24:32,996 INFO L226 Difference]: Without dead ends: 1366 [2025-01-10 00:24:32,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:32,998 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 3357 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3362 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:32,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3362 Valid, 1170 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:24:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-10 00:24:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1046. [2025-01-10 00:24:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 641 states have (on average 1.8736349453978158) internal successors, (1201), 1039 states have internal predecessors, (1201), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1219 transitions. [2025-01-10 00:24:33,037 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1219 transitions. Word has length 8 [2025-01-10 00:24:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:33,038 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1219 transitions. [2025-01-10 00:24:33,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-01-10 00:24:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1219 transitions. [2025-01-10 00:24:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:24:33,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:33,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:33,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:24:33,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2025-01-10 00:24:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941510997] [2025-01-10 00:24:33,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:24:33,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:24:33,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:33,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941510997] [2025-01-10 00:24:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941510997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:24:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001313237] [2025-01-10 00:24:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:33,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:33,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:33,109 INFO L87 Difference]: Start difference. First operand 1046 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:33,756 INFO L93 Difference]: Finished difference Result 1319 states and 1580 transitions. [2025-01-10 00:24:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:33,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:24:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:33,763 INFO L225 Difference]: With dead ends: 1319 [2025-01-10 00:24:33,763 INFO L226 Difference]: Without dead ends: 1319 [2025-01-10 00:24:33,763 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-01-10 00:24:33,765 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 1073 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:33,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1488 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:24:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-01-10 00:24:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 999. [2025-01-10 00:24:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 641 states have (on average 1.8003120124804992) internal successors, (1154), 992 states have internal predecessors, (1154), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1172 transitions. [2025-01-10 00:24:33,800 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1172 transitions. Word has length 9 [2025-01-10 00:24:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:33,800 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1172 transitions. [2025-01-10 00:24:33,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1172 transitions. [2025-01-10 00:24:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:24:33,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:33,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:24:33,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:33,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2025-01-10 00:24:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977857304] [2025-01-10 00:24:33,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:33,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:24:33,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:24:33,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:33,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977857304] [2025-01-10 00:24:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977857304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:24:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159889170] [2025-01-10 00:24:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:33,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:33,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:33,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:33,914 INFO L87 Difference]: Start difference. First operand 999 states and 1172 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:34,458 INFO L93 Difference]: Finished difference Result 1400 states and 1665 transitions. [2025-01-10 00:24:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:24:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:34,463 INFO L225 Difference]: With dead ends: 1400 [2025-01-10 00:24:34,463 INFO L226 Difference]: Without dead ends: 1400 [2025-01-10 00:24:34,463 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-01-10 00:24:34,464 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 814 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:34,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1852 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:24:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-01-10 00:24:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1029. [2025-01-10 00:24:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 681 states have (on average 1.7958883994126285) internal successors, (1223), 1022 states have internal predecessors, (1223), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1241 transitions. [2025-01-10 00:24:34,490 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1241 transitions. Word has length 9 [2025-01-10 00:24:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1241 transitions. [2025-01-10 00:24:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1241 transitions. [2025-01-10 00:24:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:24:34,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:34,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:34,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:24:34,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1259515419, now seen corresponding path program 1 times [2025-01-10 00:24:34,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:34,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894422029] [2025-01-10 00:24:34,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:34,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:24:34,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:24:34,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:34,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:34,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894422029] [2025-01-10 00:24:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894422029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722086594] [2025-01-10 00:24:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:34,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:34,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:34,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:34,603 INFO L87 Difference]: Start difference. First operand 1029 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:34,752 INFO L93 Difference]: Finished difference Result 2036 states and 2462 transitions. [2025-01-10 00:24:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:34,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 00:24:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:34,760 INFO L225 Difference]: With dead ends: 2036 [2025-01-10 00:24:34,760 INFO L226 Difference]: Without dead ends: 2036 [2025-01-10 00:24:34,760 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-01-10 00:24:34,761 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 1113 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3795 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:34,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3795 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:24:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2025-01-10 00:24:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1031. [2025-01-10 00:24:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 683 states have (on average 1.7935578330893118) internal successors, (1225), 1024 states have internal predecessors, (1225), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1243 transitions. [2025-01-10 00:24:34,791 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1243 transitions. Word has length 10 [2025-01-10 00:24:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:34,791 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1243 transitions. [2025-01-10 00:24:34,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1243 transitions. [2025-01-10 00:24:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:24:34,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:34,791 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-01-10 00:24:34,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:24:34,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:34,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash 495194974, now seen corresponding path program 1 times [2025-01-10 00:24:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:34,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362013977] [2025-01-10 00:24:34,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:34,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:24:34,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:24:34,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:34,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:34,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:34,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362013977] [2025-01-10 00:24:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362013977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:34,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:34,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:34,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317925067] [2025-01-10 00:24:34,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:34,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:34,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:34,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:34,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:34,870 INFO L87 Difference]: Start difference. First operand 1031 states and 1243 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:35,556 INFO L93 Difference]: Finished difference Result 1058 states and 1297 transitions. [2025-01-10 00:24:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 00:24:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:35,560 INFO L225 Difference]: With dead ends: 1058 [2025-01-10 00:24:35,560 INFO L226 Difference]: Without dead ends: 1058 [2025-01-10 00:24:35,560 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-01-10 00:24:35,561 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1337 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:35,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1336 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:24:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-01-10 00:24:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1008. [2025-01-10 00:24:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 683 states have (on average 1.759882869692533) internal successors, (1202), 1001 states have internal predecessors, (1202), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1220 transitions. [2025-01-10 00:24:35,585 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1220 transitions. Word has length 19 [2025-01-10 00:24:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:35,585 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1220 transitions. [2025-01-10 00:24:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1220 transitions. [2025-01-10 00:24:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 00:24:35,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:35,586 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-01-10 00:24:35,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:24:35,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:35,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 495194975, now seen corresponding path program 1 times [2025-01-10 00:24:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:35,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486835669] [2025-01-10 00:24:35,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:35,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:24:35,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:24:35,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:35,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:35,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486835669] [2025-01-10 00:24:35,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486835669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279373435] [2025-01-10 00:24:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:35,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:35,697 INFO L87 Difference]: Start difference. First operand 1008 states and 1220 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:35,722 INFO L93 Difference]: Finished difference Result 933 states and 1117 transitions. [2025-01-10 00:24:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 00:24:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:35,725 INFO L225 Difference]: With dead ends: 933 [2025-01-10 00:24:35,726 INFO L226 Difference]: Without dead ends: 933 [2025-01-10 00:24:35,726 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-01-10 00:24:35,726 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 60 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:35,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1981 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-01-10 00:24:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2025-01-10 00:24:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 620 states have (on average 1.7725806451612902) internal successors, (1099), 926 states have internal predecessors, (1099), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1117 transitions. [2025-01-10 00:24:35,742 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1117 transitions. Word has length 19 [2025-01-10 00:24:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:35,743 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1117 transitions. [2025-01-10 00:24:35,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1117 transitions. [2025-01-10 00:24:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 00:24:35,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:35,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:35,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:24:35,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:35,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1828609380, now seen corresponding path program 1 times [2025-01-10 00:24:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651257705] [2025-01-10 00:24:35,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:35,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:24:35,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:24:35,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:35,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651257705] [2025-01-10 00:24:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651257705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773682289] [2025-01-10 00:24:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:35,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:35,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:35,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:35,811 INFO L87 Difference]: Start difference. First operand 933 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:35,863 INFO L93 Difference]: Finished difference Result 915 states and 1092 transitions. [2025-01-10 00:24:35,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:35,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 00:24:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:35,867 INFO L225 Difference]: With dead ends: 915 [2025-01-10 00:24:35,867 INFO L226 Difference]: Without dead ends: 915 [2025-01-10 00:24:35,867 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-01-10 00:24:35,868 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 41 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2918 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:35,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2918 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-10 00:24:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 912. [2025-01-10 00:24:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 606 states have (on average 1.7673267326732673) internal successors, (1071), 905 states have internal predecessors, (1071), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1089 transitions. [2025-01-10 00:24:35,883 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1089 transitions. Word has length 20 [2025-01-10 00:24:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:35,883 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1089 transitions. [2025-01-10 00:24:35,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1089 transitions. [2025-01-10 00:24:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 00:24:35,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:35,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:35,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:24:35,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:35,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1048342954, now seen corresponding path program 1 times [2025-01-10 00:24:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:35,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312315656] [2025-01-10 00:24:35,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:35,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:24:35,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:24:35,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:35,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312315656] [2025-01-10 00:24:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312315656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:36,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172460371] [2025-01-10 00:24:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:36,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:36,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:36,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:36,042 INFO L87 Difference]: Start difference. First operand 912 states and 1089 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:36,787 INFO L93 Difference]: Finished difference Result 1328 states and 1585 transitions. [2025-01-10 00:24:36,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-10 00:24:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:36,791 INFO L225 Difference]: With dead ends: 1328 [2025-01-10 00:24:36,791 INFO L226 Difference]: Without dead ends: 1328 [2025-01-10 00:24:36,791 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-01-10 00:24:36,792 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 815 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:36,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1926 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:24:36,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-01-10 00:24:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 908. [2025-01-10 00:24:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 606 states have (on average 1.7607260726072607) internal successors, (1067), 901 states have internal predecessors, (1067), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1085 transitions. [2025-01-10 00:24:36,811 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1085 transitions. Word has length 34 [2025-01-10 00:24:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:36,813 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1085 transitions. [2025-01-10 00:24:36,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1085 transitions. [2025-01-10 00:24:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:24:36,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:36,815 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-01-10 00:24:36,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:24:36,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:36,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1085651552, now seen corresponding path program 1 times [2025-01-10 00:24:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155494476] [2025-01-10 00:24:36,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:36,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:24:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:24:36,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:36,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155494476] [2025-01-10 00:24:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155494476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097654874] [2025-01-10 00:24:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:36,958 INFO L87 Difference]: Start difference. First operand 908 states and 1085 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-01-10 00:24:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:37,004 INFO L93 Difference]: Finished difference Result 908 states and 1081 transitions. [2025-01-10 00:24:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:24:37,005 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-01-10 00:24:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:37,007 INFO L225 Difference]: With dead ends: 908 [2025-01-10 00:24:37,008 INFO L226 Difference]: Without dead ends: 908 [2025-01-10 00:24:37,008 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-01-10 00:24:37,008 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 21 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:37,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2900 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-01-10 00:24:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-01-10 00:24:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 606 states have (on average 1.7541254125412542) internal successors, (1063), 901 states have internal predecessors, (1063), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 00:24:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1081 transitions. [2025-01-10 00:24:37,023 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1081 transitions. Word has length 68 [2025-01-10 00:24:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1081 transitions. [2025-01-10 00:24:37,023 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-01-10 00:24:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1081 transitions. [2025-01-10 00:24:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:24:37,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:37,026 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-01-10 00:24:37,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:24:37,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1491712468, now seen corresponding path program 1 times [2025-01-10 00:24:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:37,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634207285] [2025-01-10 00:24:37,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:37,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:37,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:24:37,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:24:37,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:37,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634207285] [2025-01-10 00:24:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634207285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:37,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:37,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:37,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093208187] [2025-01-10 00:24:37,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:37,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:37,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:37,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:37,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:37,204 INFO L87 Difference]: Start difference. First operand 908 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:37,289 INFO L93 Difference]: Finished difference Result 1246 states and 1523 transitions. [2025-01-10 00:24:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:24:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:37,293 INFO L225 Difference]: With dead ends: 1246 [2025-01-10 00:24:37,293 INFO L226 Difference]: Without dead ends: 1246 [2025-01-10 00:24:37,294 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-01-10 00:24:37,294 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 360 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:37,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 2218 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:24:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-01-10 00:24:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1192. [2025-01-10 00:24:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 885 states have (on average 1.6858757062146892) internal successors, (1492), 1185 states have internal predecessors, (1492), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:24:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1520 transitions. [2025-01-10 00:24:37,312 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1520 transitions. Word has length 76 [2025-01-10 00:24:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:37,313 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1520 transitions. [2025-01-10 00:24:37,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1520 transitions. [2025-01-10 00:24:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 00:24:37,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 00:24:37,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:24:37,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:37,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash 311454554, now seen corresponding path program 1 times [2025-01-10 00:24:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928467029] [2025-01-10 00:24:37,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:37,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 00:24:37,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 00:24:37,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:37,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928467029] [2025-01-10 00:24:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928467029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:37,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:37,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:24:37,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960464604] [2025-01-10 00:24:37,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:37,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:24:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:37,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:24:37,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:37,855 INFO L87 Difference]: Start difference. First operand 1192 states and 1520 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:38,497 INFO L93 Difference]: Finished difference Result 1154 states and 1482 transitions. [2025-01-10 00:24:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:24:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-10 00:24:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:38,501 INFO L225 Difference]: With dead ends: 1154 [2025-01-10 00:24:38,501 INFO L226 Difference]: Without dead ends: 1154 [2025-01-10 00:24:38,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:38,502 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 1731 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:38,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 985 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:24:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-01-10 00:24:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1114. [2025-01-10 00:24:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 845 states have (on average 1.6272189349112427) internal successors, (1375), 1107 states have internal predecessors, (1375), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:24:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1403 transitions. [2025-01-10 00:24:38,524 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1403 transitions. Word has length 79 [2025-01-10 00:24:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:38,525 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1403 transitions. [2025-01-10 00:24:38,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1403 transitions. [2025-01-10 00:24:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:24:38,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:38,526 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-01-10 00:24:38,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:24:38,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:38,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079487, now seen corresponding path program 1 times [2025-01-10 00:24:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404435785] [2025-01-10 00:24:38,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:38,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:24:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:24:38,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404435785] [2025-01-10 00:24:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404435785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:38,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:38,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:38,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332854559] [2025-01-10 00:24:38,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:38,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:24:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:38,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:24:38,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:38,798 INFO L87 Difference]: Start difference. First operand 1114 states and 1403 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-01-10 00:24:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:39,498 INFO L93 Difference]: Finished difference Result 1113 states and 1402 transitions. [2025-01-10 00:24:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:39,498 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-01-10 00:24:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:39,502 INFO L225 Difference]: With dead ends: 1113 [2025-01-10 00:24:39,502 INFO L226 Difference]: Without dead ends: 1113 [2025-01-10 00:24:39,502 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-01-10 00:24:39,503 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 2 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:39,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2828 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:24:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-01-10 00:24:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2025-01-10 00:24:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 845 states have (on average 1.6260355029585798) internal successors, (1374), 1106 states have internal predecessors, (1374), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:24:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1402 transitions. [2025-01-10 00:24:39,527 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1402 transitions. Word has length 84 [2025-01-10 00:24:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:39,528 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1402 transitions. [2025-01-10 00:24:39,528 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-01-10 00:24:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1402 transitions. [2025-01-10 00:24:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:24:39,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:39,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:39,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:24:39,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:39,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1497079488, now seen corresponding path program 1 times [2025-01-10 00:24:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:39,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120457518] [2025-01-10 00:24:39,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:39,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:24:39,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:24:39,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:39,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:40,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120457518] [2025-01-10 00:24:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120457518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:40,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410841100] [2025-01-10 00:24:40,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:40,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:24:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:40,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:24:40,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:40,013 INFO L87 Difference]: Start difference. First operand 1113 states and 1402 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-01-10 00:24:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:40,739 INFO L93 Difference]: Finished difference Result 1112 states and 1401 transitions. [2025-01-10 00:24:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:40,739 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-01-10 00:24:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:40,743 INFO L225 Difference]: With dead ends: 1112 [2025-01-10 00:24:40,743 INFO L226 Difference]: Without dead ends: 1112 [2025-01-10 00:24:40,743 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-01-10 00:24:40,743 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 1 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:40,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2845 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:24:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-01-10 00:24:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-01-10 00:24:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 844 states have (on average 1.6267772511848342) internal successors, (1373), 1105 states have internal predecessors, (1373), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:24:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1401 transitions. [2025-01-10 00:24:40,757 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1401 transitions. Word has length 84 [2025-01-10 00:24:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:40,757 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1401 transitions. [2025-01-10 00:24:40,757 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-01-10 00:24:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1401 transitions. [2025-01-10 00:24:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:24:40,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:40,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] [2025-01-10 00:24:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:24:40,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -848442586, now seen corresponding path program 1 times [2025-01-10 00:24:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9939586] [2025-01-10 00:24:40,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:24:40,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:24:40,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9939586] [2025-01-10 00:24:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9939586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:40,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:40,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:24:40,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535693457] [2025-01-10 00:24:40,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:40,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:24:40,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:40,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:24:40,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:24:40,989 INFO L87 Difference]: Start difference. First operand 1112 states and 1401 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-01-10 00:24:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:41,715 INFO L93 Difference]: Finished difference Result 1124 states and 1416 transitions. [2025-01-10 00:24:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:24:41,716 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-01-10 00:24:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:41,720 INFO L225 Difference]: With dead ends: 1124 [2025-01-10 00:24:41,720 INFO L226 Difference]: Without dead ends: 1124 [2025-01-10 00:24:41,721 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-01-10 00:24:41,721 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 13 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:41,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3786 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:24:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-01-10 00:24:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1118. [2025-01-10 00:24:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 849 states have (on average 1.6254416961130742) internal successors, (1380), 1110 states have internal predecessors, (1380), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 00:24:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1411 transitions. [2025-01-10 00:24:41,741 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1411 transitions. Word has length 92 [2025-01-10 00:24:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:41,741 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1411 transitions. [2025-01-10 00:24:41,741 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-01-10 00:24:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1411 transitions. [2025-01-10 00:24:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:24:41,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:41,743 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-01-10 00:24:41,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:24:41,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash -848442585, now seen corresponding path program 1 times [2025-01-10 00:24:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108181017] [2025-01-10 00:24:41,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:41,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:24:41,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:24:41,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:41,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108181017] [2025-01-10 00:24:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108181017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:24:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866299286] [2025-01-10 00:24:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:42,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:24:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:42,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:24:42,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:42,221 INFO L87 Difference]: Start difference. First operand 1118 states and 1411 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-01-10 00:24:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:43,055 INFO L93 Difference]: Finished difference Result 1118 states and 1410 transitions. [2025-01-10 00:24:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:43,055 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-01-10 00:24:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:43,059 INFO L225 Difference]: With dead ends: 1118 [2025-01-10 00:24:43,060 INFO L226 Difference]: Without dead ends: 1118 [2025-01-10 00:24:43,060 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-01-10 00:24:43,060 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 8 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:43,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3609 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:24:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-01-10 00:24:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2025-01-10 00:24:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 849 states have (on average 1.624263839811543) internal successors, (1379), 1110 states have internal predecessors, (1379), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 00:24:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1410 transitions. [2025-01-10 00:24:43,077 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1410 transitions. Word has length 92 [2025-01-10 00:24:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:43,078 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1410 transitions. [2025-01-10 00:24:43,078 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-01-10 00:24:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1410 transitions. [2025-01-10 00:24:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:24:43,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:43,079 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-01-10 00:24:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:24:43,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:43,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 37298660, now seen corresponding path program 1 times [2025-01-10 00:24:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990119236] [2025-01-10 00:24:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:24:43,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:24:43,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:43,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990119236] [2025-01-10 00:24:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990119236] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87748397] [2025-01-10 00:24:43,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:43,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:43,561 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-01-10 00:24:43,562 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-01-10 00:24:43,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:24:43,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:24:43,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:43,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:43,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:24:43,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:24:43,823 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-01-10 00:24:43,977 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:24:43,977 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-01-10 00:24:44,019 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-01-10 00:24:44,106 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-01-10 00:24:44,310 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:44,311 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-01-10 00:24:44,357 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-01-10 00:24:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:44,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:24:44,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_650 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:24:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87748397] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:44,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:24:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-01-10 00:24:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982497362] [2025-01-10 00:24:44,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:24:44,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:24:44,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:44,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:24:44,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-01-10 00:24:44,430 INFO L87 Difference]: Start difference. First operand 1118 states and 1410 transitions. Second operand has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:24:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:46,973 INFO L93 Difference]: Finished difference Result 1125 states and 1417 transitions. [2025-01-10 00:24:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:24:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-01-10 00:24:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:46,977 INFO L225 Difference]: With dead ends: 1125 [2025-01-10 00:24:46,977 INFO L226 Difference]: Without dead ends: 1125 [2025-01-10 00:24:46,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-01-10 00:24:46,978 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 868 mSDsluCounter, 7821 mSDsCounter, 0 mSdLazyCounter, 4833 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 8445 SdHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:46,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 8445 Invalid, 4854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4833 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-10 00:24:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-01-10 00:24:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1122. [2025-01-10 00:24:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 853 states have (on average 1.6213364595545134) internal successors, (1383), 1113 states have internal predecessors, (1383), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:24:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1412 transitions. [2025-01-10 00:24:46,995 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1412 transitions. Word has length 93 [2025-01-10 00:24:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:46,996 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1412 transitions. [2025-01-10 00:24:46,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.125) internal successors, (146), 18 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:24:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1412 transitions. [2025-01-10 00:24:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:24:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:46,997 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-01-10 00:24:47,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:24:47,200 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,SelfDestructingSolverStorable17 [2025-01-10 00:24:47,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 37298661, now seen corresponding path program 1 times [2025-01-10 00:24:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400261168] [2025-01-10 00:24:47,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:47,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:47,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:24:47,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:24:47,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:47,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400261168] [2025-01-10 00:24:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400261168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324359906] [2025-01-10 00:24:47,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:47,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:47,921 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-01-10 00:24:47,923 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-01-10 00:24:48,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:24:48,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:24:48,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:48,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:48,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:24:48,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:24:48,150 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-01-10 00:24:48,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:24:48,266 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-01-10 00:24:48,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:24:48,288 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-01-10 00:24:48,292 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-01-10 00:24:48,360 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-01-10 00:24:48,364 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-01-10 00:24:48,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:48,476 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-01-10 00:24:48,481 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-01-10 00:24:48,510 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-01-10 00:24:48,517 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-01-10 00:24:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:48,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:24:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324359906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:48,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:24:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-01-10 00:24:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286793474] [2025-01-10 00:24:48,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:24:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:24:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:48,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:24:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=249, Unknown=5, NotChecked=0, Total=306 [2025-01-10 00:24:48,646 INFO L87 Difference]: Start difference. First operand 1122 states and 1412 transitions. Second operand has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:24:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:50,404 INFO L93 Difference]: Finished difference Result 1124 states and 1416 transitions. [2025-01-10 00:24:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:24:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 93 [2025-01-10 00:24:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:50,408 INFO L225 Difference]: With dead ends: 1124 [2025-01-10 00:24:50,408 INFO L226 Difference]: Without dead ends: 1124 [2025-01-10 00:24:50,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=375, Unknown=6, NotChecked=0, Total=462 [2025-01-10 00:24:50,409 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 868 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:50,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 4964 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:24:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-01-10 00:24:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1115. [2025-01-10 00:24:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 848 states have (on average 1.6226415094339623) internal successors, (1376), 1107 states have internal predecessors, (1376), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:24:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1404 transitions. [2025-01-10 00:24:50,425 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1404 transitions. Word has length 93 [2025-01-10 00:24:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1404 transitions. [2025-01-10 00:24:50,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.666666666666666) internal successors, (140), 15 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:24:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1404 transitions. [2025-01-10 00:24:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:24:50,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:50,426 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-01-10 00:24:50,435 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-01-10 00:24:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:50,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:50,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -69903039, now seen corresponding path program 1 times [2025-01-10 00:24:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:50,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258067005] [2025-01-10 00:24:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:50,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:24:50,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:24:50,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:50,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:51,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258067005] [2025-01-10 00:24:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258067005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:51,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:24:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43862183] [2025-01-10 00:24:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:24:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:51,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:24:51,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:24:51,103 INFO L87 Difference]: Start difference. First operand 1115 states and 1404 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-01-10 00:24:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:52,605 INFO L93 Difference]: Finished difference Result 1128 states and 1420 transitions. [2025-01-10 00:24:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:24:52,606 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-01-10 00:24:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:52,609 INFO L225 Difference]: With dead ends: 1128 [2025-01-10 00:24:52,609 INFO L226 Difference]: Without dead ends: 1128 [2025-01-10 00:24:52,609 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-01-10 00:24:52,610 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 903 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 5468 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 5468 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:24:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-10 00:24:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1124. [2025-01-10 00:24:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 856 states have (on average 1.6191588785046729) internal successors, (1386), 1115 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:24:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1415 transitions. [2025-01-10 00:24:52,626 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1415 transitions. Word has length 95 [2025-01-10 00:24:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:52,626 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1415 transitions. [2025-01-10 00:24:52,626 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-01-10 00:24:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1415 transitions. [2025-01-10 00:24:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:24:52,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:52,627 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-01-10 00:24:52,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:24:52,628 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:52,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash -69903038, now seen corresponding path program 1 times [2025-01-10 00:24:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:52,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58486977] [2025-01-10 00:24:52,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:52,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:24:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:24:52,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58486977] [2025-01-10 00:24:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58486977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:24:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059424815] [2025-01-10 00:24:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:53,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:24:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:24:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:24:53,232 INFO L87 Difference]: Start difference. First operand 1124 states and 1415 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-01-10 00:24:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:54,744 INFO L93 Difference]: Finished difference Result 1127 states and 1419 transitions. [2025-01-10 00:24:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:24:54,744 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-01-10 00:24:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:54,748 INFO L225 Difference]: With dead ends: 1127 [2025-01-10 00:24:54,748 INFO L226 Difference]: Without dead ends: 1127 [2025-01-10 00:24:54,748 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-01-10 00:24:54,748 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 880 mSDsluCounter, 3640 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:54,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 4268 Invalid, 3345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3328 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:24:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-10 00:24:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1124. [2025-01-10 00:24:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 856 states have (on average 1.6179906542056075) internal successors, (1385), 1115 states have internal predecessors, (1385), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:24:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1414 transitions. [2025-01-10 00:24:54,765 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1414 transitions. Word has length 95 [2025-01-10 00:24:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:54,765 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1414 transitions. [2025-01-10 00:24:54,765 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-01-10 00:24:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1414 transitions. [2025-01-10 00:24:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:24:54,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:54,766 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-01-10 00:24:54,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:24:54,766 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:54,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:54,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1231510077, now seen corresponding path program 1 times [2025-01-10 00:24:54,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:54,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137375266] [2025-01-10 00:24:54,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:54,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:24:54,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:24:54,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:54,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137375266] [2025-01-10 00:24:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137375266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109047022] [2025-01-10 00:24:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:55,252 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-01-10 00:24:55,255 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-01-10 00:24:55,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:24:55,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:24:55,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:55,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:55,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:24:55,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:24:55,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:24:55,623 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:24:55,623 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-01-10 00:24:55,656 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-01-10 00:24:55,739 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-01-10 00:24:55,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:55,872 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-01-10 00:24:55,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:55,943 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-01-10 00:24:55,966 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-01-10 00:24:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:55,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:24:56,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1076 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:24:56,068 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1076 (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_1079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1076)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:24:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109047022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:56,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:24:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-01-10 00:24:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995978158] [2025-01-10 00:24:56,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:24:56,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:24:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:24:56,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=421, Unknown=13, NotChecked=86, Total=600 [2025-01-10 00:24:56,073 INFO L87 Difference]: Start difference. First operand 1124 states and 1414 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-01-10 00:24:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:58,529 INFO L93 Difference]: Finished difference Result 1126 states and 1418 transitions. [2025-01-10 00:24:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:24:58,530 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-01-10 00:24:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:58,533 INFO L225 Difference]: With dead ends: 1126 [2025-01-10 00:24:58,534 INFO L226 Difference]: Without dead ends: 1126 [2025-01-10 00:24:58,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=542, Unknown=14, NotChecked=98, Total=756 [2025-01-10 00:24:58,535 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 861 mSDsluCounter, 8996 mSDsCounter, 0 mSdLazyCounter, 5538 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 9619 SdHoareTripleChecker+Invalid, 5556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:58,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 9619 Invalid, 5556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5538 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:24:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-01-10 00:24:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1123. [2025-01-10 00:24:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 856 states have (on average 1.6168224299065421) internal successors, (1384), 1114 states have internal predecessors, (1384), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:24:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1413 transitions. [2025-01-10 00:24:58,551 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1413 transitions. Word has length 96 [2025-01-10 00:24:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1413 transitions. [2025-01-10 00:24:58,551 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-01-10 00:24:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1413 transitions. [2025-01-10 00:24:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:24:58,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:58,552 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-01-10 00:24:58,562 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-01-10 00:24:58,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:58,756 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:24:58,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1231510076, now seen corresponding path program 1 times [2025-01-10 00:24:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621113553] [2025-01-10 00:24:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:58,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:24:58,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:24:58,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:58,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:59,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621113553] [2025-01-10 00:24:59,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621113553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:59,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263913430] [2025-01-10 00:24:59,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:59,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:59,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:59,477 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-01-10 00:24:59,480 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-01-10 00:24:59,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:24:59,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:24:59,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:59,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:59,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 00:24:59,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:24:59,728 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-01-10 00:24:59,825 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-01-10 00:24:59,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:24:59,833 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-01-10 00:24:59,844 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-01-10 00:24:59,850 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-01-10 00:24:59,908 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-01-10 00:24:59,915 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-01-10 00:25:00,024 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:00,024 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-01-10 00:25:00,029 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-01-10 00:25:00,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:00,098 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-01-10 00:25:00,106 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-01-10 00:25:00,121 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-01-10 00:25:00,125 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-01-10 00:25:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:00,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:00,234 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_1232 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:25:00,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1232 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1238))) (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_1237) .cse1 v_ArrVal_1232) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:25:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263913430] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:00,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-01-10 00:25:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168619609] [2025-01-10 00:25:00,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:00,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:25:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:00,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:25:00,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=304, Unknown=17, NotChecked=74, Total=462 [2025-01-10 00:25:00,288 INFO L87 Difference]: Start difference. First operand 1123 states and 1413 transitions. Second operand has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:02,438 INFO L93 Difference]: Finished difference Result 1125 states and 1417 transitions. [2025-01-10 00:25:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:25:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2025-01-10 00:25:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:02,443 INFO L225 Difference]: With dead ends: 1125 [2025-01-10 00:25:02,443 INFO L226 Difference]: Without dead ends: 1125 [2025-01-10 00:25:02,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=486, Unknown=17, NotChecked=94, Total=702 [2025-01-10 00:25:02,444 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 870 mSDsluCounter, 5191 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 5817 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:02,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 5817 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:25:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-01-10 00:25:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1113. [2025-01-10 00:25:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 848 states have (on average 1.6202830188679245) internal successors, (1374), 1105 states have internal predecessors, (1374), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:25:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1402 transitions. [2025-01-10 00:25:02,461 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1402 transitions. Word has length 96 [2025-01-10 00:25:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1402 transitions. [2025-01-10 00:25:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.357142857142858) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1402 transitions. [2025-01-10 00:25:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:25:02,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:02,462 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-01-10 00:25:02,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:25:02,666 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,SelfDestructingSolverStorable22 [2025-01-10 00:25:02,667 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:02,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 578350189, now seen corresponding path program 1 times [2025-01-10 00:25:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61459219] [2025-01-10 00:25:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:02,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:25:02,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:25:02,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:02,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:03,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61459219] [2025-01-10 00:25:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61459219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:03,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:03,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:25:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292515105] [2025-01-10 00:25:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:03,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:25:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:03,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:25:03,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:25:03,159 INFO L87 Difference]: Start difference. First operand 1113 states and 1402 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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-01-10 00:25:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:04,654 INFO L93 Difference]: Finished difference Result 1129 states and 1421 transitions. [2025-01-10 00:25:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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-01-10 00:25:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:04,658 INFO L225 Difference]: With dead ends: 1129 [2025-01-10 00:25:04,658 INFO L226 Difference]: Without dead ends: 1129 [2025-01-10 00:25:04,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-10 00:25:04,659 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 889 mSDsluCounter, 4827 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:04,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 5450 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:25:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-01-10 00:25:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1125. [2025-01-10 00:25:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 859 states have (on average 1.6146682188591386) internal successors, (1387), 1116 states have internal predecessors, (1387), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1416 transitions. [2025-01-10 00:25:04,673 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1416 transitions. Word has length 98 [2025-01-10 00:25:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:04,673 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1416 transitions. [2025-01-10 00:25:04,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 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-01-10 00:25:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1416 transitions. [2025-01-10 00:25:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:25:04,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:04,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:04,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:25:04,675 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 578350190, now seen corresponding path program 1 times [2025-01-10 00:25:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495526355] [2025-01-10 00:25:04,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:25:04,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:25:04,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:04,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:05,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495526355] [2025-01-10 00:25:05,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495526355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:05,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:05,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:25:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77982932] [2025-01-10 00:25:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:05,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:25:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:05,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:25:05,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:25:05,297 INFO L87 Difference]: Start difference. First operand 1125 states and 1416 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-01-10 00:25:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:06,772 INFO L93 Difference]: Finished difference Result 1128 states and 1420 transitions. [2025-01-10 00:25:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:25:06,772 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-01-10 00:25:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:06,775 INFO L225 Difference]: With dead ends: 1128 [2025-01-10 00:25:06,777 INFO L226 Difference]: Without dead ends: 1128 [2025-01-10 00:25:06,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:25:06,778 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 882 mSDsluCounter, 3732 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 4359 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:06,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 4359 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3210 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:25:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-10 00:25:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1125. [2025-01-10 00:25:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 859 states have (on average 1.6135040745052387) internal successors, (1386), 1116 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1415 transitions. [2025-01-10 00:25:06,793 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1415 transitions. Word has length 98 [2025-01-10 00:25:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:06,794 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1415 transitions. [2025-01-10 00:25:06,794 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-01-10 00:25:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1415 transitions. [2025-01-10 00:25:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:25:06,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:06,798 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-01-10 00:25:06,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:25:06,798 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:06,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -305414997, now seen corresponding path program 1 times [2025-01-10 00:25:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:06,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289327718] [2025-01-10 00:25:06,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:06,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:25:06,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:25:06,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:06,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:07,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-01-10 00:25:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289327718] [2025-01-10 00:25:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289327718] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302428816] [2025-01-10 00:25:07,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:07,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:07,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:07,282 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-01-10 00:25:07,285 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-01-10 00:25:07,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:25:07,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:25:07,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:07,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:07,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:25:07,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:07,644 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-01-10 00:25:07,751 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:25:07,752 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-01-10 00:25:07,781 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-01-10 00:25:07,861 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-01-10 00:25:07,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:07,969 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-01-10 00:25:08,032 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:08,032 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-01-10 00:25:08,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:08,083 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-01-10 00:25:08,093 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-01-10 00:25:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:08,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:08,128 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1544) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:25:08,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (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_1543))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:08,239 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (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_1547))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1543)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:08,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302428816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:08,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:08,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-01-10 00:25:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630124337] [2025-01-10 00:25:08,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:08,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:25:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:08,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:25:08,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=543, Unknown=14, NotChecked=150, Total=812 [2025-01-10 00:25:08,242 INFO L87 Difference]: Start difference. First operand 1125 states and 1415 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-01-10 00:25:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:10,172 INFO L93 Difference]: Finished difference Result 1127 states and 1419 transitions. [2025-01-10 00:25:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:25:10,172 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-01-10 00:25:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:10,175 INFO L225 Difference]: With dead ends: 1127 [2025-01-10 00:25:10,175 INFO L226 Difference]: Without dead ends: 1127 [2025-01-10 00:25:10,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=682, Unknown=14, NotChecked=168, Total=992 [2025-01-10 00:25:10,175 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 860 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 4488 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 7847 SdHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:10,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 7847 Invalid, 4507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4488 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:25:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-10 00:25:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1124. [2025-01-10 00:25:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 859 states have (on average 1.6123399301513388) internal successors, (1385), 1115 states have internal predecessors, (1385), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1414 transitions. [2025-01-10 00:25:10,188 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1414 transitions. Word has length 99 [2025-01-10 00:25:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:10,188 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1414 transitions. [2025-01-10 00:25:10,188 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-01-10 00:25:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1414 transitions. [2025-01-10 00:25:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:25:10,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:10,189 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-01-10 00:25:10,198 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-01-10 00:25:10,393 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,SelfDestructingSolverStorable25 [2025-01-10 00:25:10,393 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash -305414996, now seen corresponding path program 1 times [2025-01-10 00:25:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382100762] [2025-01-10 00:25:10,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:25:10,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:25:10,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:10,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:11,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382100762] [2025-01-10 00:25:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382100762] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934668072] [2025-01-10 00:25:11,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:11,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:11,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:11,064 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-01-10 00:25:11,066 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-01-10 00:25:11,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:25:11,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:25:11,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:11,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-10 00:25:11,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:11,290 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-01-10 00:25:11,478 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:11,478 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-01-10 00:25:11,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:11,500 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 11 treesize of output 7 [2025-01-10 00:25:11,505 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 15 treesize of output 1 [2025-01-10 00:25:11,629 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:25:11,630 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 50 treesize of output 45 [2025-01-10 00:25:11,635 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 24 treesize of output 11 [2025-01-10 00:25:11,701 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:25:11,701 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 50 treesize of output 45 [2025-01-10 00:25:11,704 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 24 treesize of output 11 [2025-01-10 00:25:11,761 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:25:11,761 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 61 treesize of output 54 [2025-01-10 00:25:11,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2025-01-10 00:25:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-10 00:25:11,789 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 7 treesize of output 3 [2025-01-10 00:25:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:11,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934668072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:12,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:12,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-01-10 00:25:12,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84604534] [2025-01-10 00:25:12,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:12,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:25:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:12,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:25:12,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=742, Unknown=16, NotChecked=0, Total=870 [2025-01-10 00:25:12,469 INFO L87 Difference]: Start difference. First operand 1124 states and 1414 transitions. Second operand has 23 states, 20 states have (on average 9.4) internal successors, (188), 23 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:15,423 INFO L93 Difference]: Finished difference Result 1636 states and 2144 transitions. [2025-01-10 00:25:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 9.4) internal successors, (188), 23 states have internal predecessors, (188), 2 states have call successors, (2), 1 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-01-10 00:25:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:15,426 INFO L225 Difference]: With dead ends: 1636 [2025-01-10 00:25:15,426 INFO L226 Difference]: Without dead ends: 1636 [2025-01-10 00:25:15,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1122, Unknown=16, NotChecked=0, Total=1332 [2025-01-10 00:25:15,427 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 1271 mSDsluCounter, 7712 mSDsCounter, 0 mSdLazyCounter, 6348 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 8333 SdHoareTripleChecker+Invalid, 6377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:15,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 8333 Invalid, 6377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6348 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:25:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-01-10 00:25:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1111. [2025-01-10 00:25:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 848 states have (on average 1.6179245283018868) internal successors, (1372), 1103 states have internal predecessors, (1372), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:25:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1400 transitions. [2025-01-10 00:25:15,441 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1400 transitions. Word has length 99 [2025-01-10 00:25:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:15,442 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1400 transitions. [2025-01-10 00:25:15,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 9.4) internal successors, (188), 23 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1400 transitions. [2025-01-10 00:25:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:25:15,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:15,443 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-01-10 00:25:15,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:25:15,643 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,SelfDestructingSolverStorable26 [2025-01-10 00:25:15,643 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:15,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1777657624, now seen corresponding path program 1 times [2025-01-10 00:25:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:15,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208437829] [2025-01-10 00:25:15,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:15,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:25:15,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:25:15,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:15,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208437829] [2025-01-10 00:25:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208437829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:16,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:25:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276582471] [2025-01-10 00:25:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:25:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:25:16,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:25:16,085 INFO L87 Difference]: Start difference. First operand 1111 states and 1400 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) [2025-01-10 00:25:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:17,547 INFO L93 Difference]: Finished difference Result 1130 states and 1422 transitions. [2025-01-10 00:25:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:25:17,547 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 101 [2025-01-10 00:25:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:17,550 INFO L225 Difference]: With dead ends: 1130 [2025-01-10 00:25:17,550 INFO L226 Difference]: Without dead ends: 1130 [2025-01-10 00:25:17,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:25:17,550 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 906 mSDsluCounter, 6029 mSDsCounter, 0 mSdLazyCounter, 3703 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 6654 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:17,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 6654 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3703 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:25:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-01-10 00:25:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2025-01-10 00:25:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 862 states have (on average 1.6102088167053363) internal successors, (1388), 1117 states have internal predecessors, (1388), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1417 transitions. [2025-01-10 00:25:17,565 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1417 transitions. Word has length 101 [2025-01-10 00:25:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:17,565 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1417 transitions. [2025-01-10 00:25:17,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-01-10 00:25:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1417 transitions. [2025-01-10 00:25:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:25:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:17,566 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-01-10 00:25:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 00:25:17,566 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1777657623, now seen corresponding path program 1 times [2025-01-10 00:25:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551229270] [2025-01-10 00:25:17,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:25:17,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:25:17,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:17,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551229270] [2025-01-10 00:25:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551229270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:25:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729616741] [2025-01-10 00:25:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:25:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:18,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:25:18,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:25:18,279 INFO L87 Difference]: Start difference. First operand 1126 states and 1417 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) [2025-01-10 00:25:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:19,444 INFO L93 Difference]: Finished difference Result 1129 states and 1421 transitions. [2025-01-10 00:25:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:25:19,444 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 101 [2025-01-10 00:25:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:19,446 INFO L225 Difference]: With dead ends: 1129 [2025-01-10 00:25:19,446 INFO L226 Difference]: Without dead ends: 1129 [2025-01-10 00:25:19,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:25:19,447 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 883 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:19,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 3304 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:25:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-01-10 00:25:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1126. [2025-01-10 00:25:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 862 states have (on average 1.6090487238979119) internal successors, (1387), 1117 states have internal predecessors, (1387), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1416 transitions. [2025-01-10 00:25:19,460 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1416 transitions. Word has length 101 [2025-01-10 00:25:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:19,460 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1416 transitions. [2025-01-10 00:25:19,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-01-10 00:25:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1416 transitions. [2025-01-10 00:25:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:25:19,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:19,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 00:25:19,461 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:19,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789270, now seen corresponding path program 1 times [2025-01-10 00:25:19,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:19,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901326585] [2025-01-10 00:25:19,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:19,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:25:19,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:25:19,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:19,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901326585] [2025-01-10 00:25:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901326585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754599174] [2025-01-10 00:25:20,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:20,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:20,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:25:20,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:25:20,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:25:20,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:20,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:20,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 00:25:20,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:20,291 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-01-10 00:25:20,372 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:25:20,372 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-01-10 00:25:20,404 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-01-10 00:25:20,480 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-01-10 00:25:20,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:20,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:20,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:20,682 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-01-10 00:25:20,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:20,730 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-01-10 00:25:20,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:20,771 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-01-10 00:25:20,781 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-01-10 00:25:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:20,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:20,864 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (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~mem57#1.base| v_ArrVal_2051))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:24,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (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~mem56#1.base| v_ArrVal_2050))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2051)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:24,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2051)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:24,956 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2052 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2055))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2051)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2052)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:24,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754599174] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:24,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-01-10 00:25:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460546306] [2025-01-10 00:25:24,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:24,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:25:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:24,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:25:24,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=679, Unknown=21, NotChecked=228, Total=1056 [2025-01-10 00:25:24,960 INFO L87 Difference]: Start difference. First operand 1126 states and 1416 transitions. Second operand has 26 states, 23 states have (on average 7.130434782608695) internal successors, (164), 25 states have internal predecessors, (164), 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-01-10 00:25:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:27,176 INFO L93 Difference]: Finished difference Result 1128 states and 1420 transitions. [2025-01-10 00:25:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:25:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.130434782608695) internal successors, (164), 25 states have internal predecessors, (164), 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 102 [2025-01-10 00:25:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:27,178 INFO L225 Difference]: With dead ends: 1128 [2025-01-10 00:25:27,178 INFO L226 Difference]: Without dead ends: 1128 [2025-01-10 00:25:27,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=151, Invalid=836, Unknown=21, NotChecked=252, Total=1260 [2025-01-10 00:25:27,179 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 857 mSDsluCounter, 6018 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 6639 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:27,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 6639 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 00:25:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-01-10 00:25:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1125. [2025-01-10 00:25:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 862 states have (on average 1.6078886310904872) internal successors, (1386), 1116 states have internal predecessors, (1386), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1415 transitions. [2025-01-10 00:25:27,191 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1415 transitions. Word has length 102 [2025-01-10 00:25:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:27,191 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1415 transitions. [2025-01-10 00:25:27,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.130434782608695) internal successors, (164), 25 states have internal predecessors, (164), 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-01-10 00:25:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1415 transitions. [2025-01-10 00:25:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:25:27,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:27,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:27,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:25:27,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:27,393 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1876789269, now seen corresponding path program 1 times [2025-01-10 00:25:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656833693] [2025-01-10 00:25:27,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:27,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:25:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:25:27,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656833693] [2025-01-10 00:25:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656833693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025303508] [2025-01-10 00:25:28,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:28,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:28,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:28,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:25:28,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:25:28,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:25:28,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:28,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 00:25:28,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:28,450 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-01-10 00:25:28,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:28,534 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-01-10 00:25:28,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:28,563 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-01-10 00:25:28,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:28,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:28,730 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 70 treesize of output 65 [2025-01-10 00:25:28,736 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 49 treesize of output 30 [2025-01-10 00:25:28,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:28,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:25:28,820 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 49 treesize of output 30 [2025-01-10 00:25:28,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:28,870 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 70 treesize of output 65 [2025-01-10 00:25:28,875 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 49 treesize of output 30 [2025-01-10 00:25:28,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:28,926 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 70 treesize of output 65 [2025-01-10 00:25:28,930 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 49 treesize of output 30 [2025-01-10 00:25:28,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-01-10 00:25:28,945 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 32 treesize of output 14 [2025-01-10 00:25:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:28,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:29,068 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_2235 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:25:29,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2234) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2233))) (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~mem57#1.base| v_ArrVal_2234) .cse1 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:25:29,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2233))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2234) .cse1 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2234) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2025-01-10 00:25:29,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2232))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2233))) (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~mem56#1.base| v_ArrVal_2231) .cse0 v_ArrVal_2234) .cse1 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2232))) (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~mem56#1.base| v_ArrVal_2231) .cse5 v_ArrVal_2234) (select (select (store .cse6 .cse5 v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2235))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-01-10 00:25:29,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2232))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2233))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2231) .cse1 v_ArrVal_2234) .cse2 v_ArrVal_2235) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2232))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2231) .cse6 v_ArrVal_2234) (select (select (store .cse7 .cse6 v_ArrVal_2233) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2235))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-01-10 00:25:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025303508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:29,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2025-01-10 00:25:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133295596] [2025-01-10 00:25:29,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:29,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 00:25:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:29,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 00:25:29,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=704, Unknown=14, NotChecked=290, Total=1122 [2025-01-10 00:25:29,273 INFO L87 Difference]: Start difference. First operand 1125 states and 1415 transitions. Second operand has 25 states, 22 states have (on average 7.454545454545454) internal successors, (164), 25 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:33,302 INFO L93 Difference]: Finished difference Result 1127 states and 1419 transitions. [2025-01-10 00:25:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.454545454545454) internal successors, (164), 25 states have internal predecessors, (164), 2 states have call successors, (2), 1 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 102 [2025-01-10 00:25:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:33,304 INFO L225 Difference]: With dead ends: 1127 [2025-01-10 00:25:33,304 INFO L226 Difference]: Without dead ends: 1127 [2025-01-10 00:25:33,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=1081, Unknown=14, NotChecked=360, Total=1640 [2025-01-10 00:25:33,305 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 862 mSDsluCounter, 9042 mSDsCounter, 0 mSdLazyCounter, 7312 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 9663 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:33,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 9663 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 7312 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-10 00:25:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-01-10 00:25:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1109. [2025-01-10 00:25:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 848 states have (on average 1.615566037735849) internal successors, (1370), 1101 states have internal predecessors, (1370), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 00:25:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1398 transitions. [2025-01-10 00:25:33,314 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1398 transitions. Word has length 102 [2025-01-10 00:25:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:33,314 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1398 transitions. [2025-01-10 00:25:33,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.454545454545454) internal successors, (164), 25 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1398 transitions. [2025-01-10 00:25:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 00:25:33,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:33,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:33,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:25:33,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:33,515 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:33,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash -121845910, now seen corresponding path program 1 times [2025-01-10 00:25:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275558364] [2025-01-10 00:25:33,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:33,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 00:25:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 00:25:33,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:33,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275558364] [2025-01-10 00:25:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275558364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:25:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697051342] [2025-01-10 00:25:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:25:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:34,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:25:34,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:25:34,111 INFO L87 Difference]: Start difference. First operand 1109 states and 1398 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 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-01-10 00:25:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:36,018 INFO L93 Difference]: Finished difference Result 1132 states and 1424 transitions. [2025-01-10 00:25:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:25:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 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 105 [2025-01-10 00:25:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:36,020 INFO L225 Difference]: With dead ends: 1132 [2025-01-10 00:25:36,020 INFO L226 Difference]: Without dead ends: 1132 [2025-01-10 00:25:36,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:25:36,021 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 902 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 3436 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 5989 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:36,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 5989 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3436 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:25:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-01-10 00:25:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1128. [2025-01-10 00:25:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 866 states have (on average 1.6050808314087759) internal successors, (1390), 1119 states have internal predecessors, (1390), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-10 00:25:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1419 transitions. [2025-01-10 00:25:36,031 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1419 transitions. Word has length 105 [2025-01-10 00:25:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:36,031 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1419 transitions. [2025-01-10 00:25:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 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-01-10 00:25:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1419 transitions. [2025-01-10 00:25:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 00:25:36,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:36,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:36,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 00:25:36,032 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-01-10 00:25:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash -121845909, now seen corresponding path program 1 times [2025-01-10 00:25:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643762878] [2025-01-10 00:25:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:36,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 00:25:36,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 00:25:36,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:36,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643762878] [2025-01-10 00:25:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643762878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:36,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-10 00:25:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152681248] [2025-01-10 00:25:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:36,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:25:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:36,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:25:36,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:25:36,869 INFO L87 Difference]: Start difference. First operand 1128 states and 1419 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 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)