./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-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 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:17:56,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:17:56,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:17:56,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:17:56,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:17:56,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:17:56,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:17:56,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:17:56,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:17:56,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:17:56,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:17:56,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:17:56,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:17:56,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:17:56,903 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:17:56,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:17:56,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:17:56,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:17:56,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:17:56,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:17:56,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:17:56,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:17:56,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:17:56,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:17:56,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:17:56,905 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 -> 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 [2025-02-06 12:17:57,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:17:57,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:17:57,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:17:57,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:17:57,097 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:17:57,098 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_JEN_test5-1.i [2025-02-06 12:17:58,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8f54380b/344ebcc7ea0b4941b5133410332b6ae1/FLAGe97de1138 [2025-02-06 12:17:58,566 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:17:58,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2025-02-06 12:17:58,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8f54380b/344ebcc7ea0b4941b5133410332b6ae1/FLAGe97de1138 [2025-02-06 12:17:58,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8f54380b/344ebcc7ea0b4941b5133410332b6ae1 [2025-02-06 12:17:58,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:17:58,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:17:58,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:17:58,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:17:58,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:17:58,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:17:58" (1/1) ... [2025-02-06 12:17:58,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cec4337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:58, skipping insertion in model container [2025-02-06 12:17:58,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:17:58" (1/1) ... [2025-02-06 12:17:58,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:17:59,155 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,192 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,198 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,204 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,212 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,242 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,248 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,250 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,256 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,282 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,282 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,283 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,287 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:17:59,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:17:59,310 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:17:59,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:17:59,439 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:17:59,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59 WrapperNode [2025-02-06 12:17:59,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:17:59,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:17:59,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:17:59,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:17:59,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,532 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1990 [2025-02-06 12:17:59,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:17:59,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:17:59,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:17:59,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:17:59,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,631 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-02-06 12:17:59,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:17:59,692 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:17:59,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:17:59,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:17:59,693 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (1/1) ... [2025-02-06 12:17:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:17:59,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:59,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:17:59,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:17:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 12:17:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 12:17:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:17:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:17:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:17:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:17:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:17:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:17:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:17:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:17:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:17:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:17:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:17:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:17:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:17:59,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:17:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:17:59,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:17:59,927 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:17:59,929 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:18:02,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-02-06 12:18:02,180 INFO L? ?]: Removed 1734 outVars from TransFormulas that were not future-live. [2025-02-06 12:18:02,183 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:18:02,283 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:18:02,283 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 12:18:02,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:18:02 BoogieIcfgContainer [2025-02-06 12:18:02,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:18:02,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:18:02,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:18:02,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:18:02,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:17:58" (1/3) ... [2025-02-06 12:18:02,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca86392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:18:02, skipping insertion in model container [2025-02-06 12:18:02,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:17:59" (2/3) ... [2025-02-06 12:18:02,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca86392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:18:02, skipping insertion in model container [2025-02-06 12:18:02,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:18:02" (3/3) ... [2025-02-06 12:18:02,296 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-1.i [2025-02-06 12:18:02,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:18:02,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test5-1.i that has 6 procedures, 1757 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2025-02-06 12:18:02,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:18:02,375 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;@1eb3a260, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:18:02,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2025-02-06 12:18:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 1747 states, 1024 states have (on average 2.017578125) internal successors, (2066), 1737 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 12:18:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:18:02,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:02,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:18:02,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:02,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2088215325, now seen corresponding path program 1 times [2025-02-06 12:18:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148314573] [2025-02-06 12:18:02,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:02,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:18:02,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:18:02,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:02,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:02,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:02,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148314573] [2025-02-06 12:18:02,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148314573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:02,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:02,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:18:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925691598] [2025-02-06 12:18:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:02,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:18:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:02,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:18:02,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:02,570 INFO L87 Difference]: Start difference. First operand has 1747 states, 1024 states have (on average 2.017578125) internal successors, (2066), 1737 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:02,896 INFO L93 Difference]: Finished difference Result 3435 states and 3955 transitions. [2025-02-06 12:18:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:18:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 12:18:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:02,917 INFO L225 Difference]: With dead ends: 3435 [2025-02-06 12:18:02,917 INFO L226 Difference]: Without dead ends: 3433 [2025-02-06 12:18:02,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:02,920 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 1943 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:02,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 4084 Invalid, 147 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:18:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-02-06 12:18:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 1727. [2025-02-06 12:18:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1016 states have (on average 1.9320866141732282) internal successors, (1963), 1717 states have internal predecessors, (1963), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 1987 transitions. [2025-02-06 12:18:03,032 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 1987 transitions. Word has length 5 [2025-02-06 12:18:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:03,032 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 1987 transitions. [2025-02-06 12:18:03,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 1987 transitions. [2025-02-06 12:18:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:18:03,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:03,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:18:03,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:18:03,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2089896139, now seen corresponding path program 1 times [2025-02-06 12:18:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556955387] [2025-02-06 12:18:03,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:03,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:18:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:18:03,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:03,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556955387] [2025-02-06 12:18:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556955387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:03,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:18:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881661271] [2025-02-06 12:18:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:03,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:18:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:03,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:18:03,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:03,100 INFO L87 Difference]: Start difference. First operand 1727 states and 1987 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:03,901 INFO L93 Difference]: Finished difference Result 1635 states and 1895 transitions. [2025-02-06 12:18:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:18:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 12:18:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:03,907 INFO L225 Difference]: With dead ends: 1635 [2025-02-06 12:18:03,908 INFO L226 Difference]: Without dead ends: 1635 [2025-02-06 12:18:03,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:03,909 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 1746 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:03,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1141 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:18:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2025-02-06 12:18:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2025-02-06 12:18:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1016 states have (on average 1.8415354330708662) internal successors, (1871), 1625 states have internal predecessors, (1871), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1895 transitions. [2025-02-06 12:18:03,932 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1895 transitions. Word has length 5 [2025-02-06 12:18:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:03,932 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 1895 transitions. [2025-02-06 12:18:03,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1895 transitions. [2025-02-06 12:18:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 12:18:03,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:03,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:18:03,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:18:03,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr710REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:03,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2089896140, now seen corresponding path program 1 times [2025-02-06 12:18:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121543139] [2025-02-06 12:18:03,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:03,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:18:03,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:18:03,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:03,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121543139] [2025-02-06 12:18:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121543139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:18:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105692229] [2025-02-06 12:18:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:04,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:18:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:04,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:18:04,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:04,026 INFO L87 Difference]: Start difference. First operand 1635 states and 1895 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:05,038 INFO L93 Difference]: Finished difference Result 2379 states and 2803 transitions. [2025-02-06 12:18:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:18:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 12:18:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:05,045 INFO L225 Difference]: With dead ends: 2379 [2025-02-06 12:18:05,045 INFO L226 Difference]: Without dead ends: 2379 [2025-02-06 12:18:05,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:05,045 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 1224 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:05,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2385 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:18:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-02-06 12:18:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1903. [2025-02-06 12:18:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1294 states have (on average 1.8160741885625966) internal successors, (2350), 1893 states have internal predecessors, (2350), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2374 transitions. [2025-02-06 12:18:05,071 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2374 transitions. Word has length 5 [2025-02-06 12:18:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:05,071 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2374 transitions. [2025-02-06 12:18:05,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2374 transitions. [2025-02-06 12:18:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:18:05,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:05,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:05,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:18:05,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:05,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1495697316, now seen corresponding path program 1 times [2025-02-06 12:18:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366519131] [2025-02-06 12:18:05,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:05,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:05,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:18:05,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:18:05,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:05,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366519131] [2025-02-06 12:18:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366519131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:18:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896629712] [2025-02-06 12:18:05,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:05,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:18:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:05,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:18:05,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:18:05,119 INFO L87 Difference]: Start difference. First operand 1903 states and 2374 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:06,157 INFO L93 Difference]: Finished difference Result 1929 states and 2427 transitions. [2025-02-06 12:18:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:18:06,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 12:18:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:06,166 INFO L225 Difference]: With dead ends: 1929 [2025-02-06 12:18:06,169 INFO L226 Difference]: Without dead ends: 1929 [2025-02-06 12:18:06,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:18:06,170 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 2013 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:06,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 2078 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:18:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-02-06 12:18:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1880. [2025-02-06 12:18:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1294 states have (on average 1.7982998454404946) internal successors, (2327), 1870 states have internal predecessors, (2327), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2351 transitions. [2025-02-06 12:18:06,219 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2351 transitions. Word has length 11 [2025-02-06 12:18:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:06,219 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2351 transitions. [2025-02-06 12:18:06,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2351 transitions. [2025-02-06 12:18:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 12:18:06,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:06,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:06,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:18:06,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1495697317, now seen corresponding path program 1 times [2025-02-06 12:18:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715463918] [2025-02-06 12:18:06,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:06,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 12:18:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 12:18:06,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:06,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715463918] [2025-02-06 12:18:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715463918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:18:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370605756] [2025-02-06 12:18:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:18:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:06,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:18:06,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:06,327 INFO L87 Difference]: Start difference. First operand 1880 states and 2351 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:06,536 INFO L93 Difference]: Finished difference Result 1805 states and 2248 transitions. [2025-02-06 12:18:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:18:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 12:18:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:06,548 INFO L225 Difference]: With dead ends: 1805 [2025-02-06 12:18:06,548 INFO L226 Difference]: Without dead ends: 1805 [2025-02-06 12:18:06,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:06,549 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 60 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:06,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3331 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:18:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-02-06 12:18:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2025-02-06 12:18:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1231 states have (on average 1.8066612510154345) internal successors, (2224), 1795 states have internal predecessors, (2224), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2248 transitions. [2025-02-06 12:18:06,600 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2248 transitions. Word has length 11 [2025-02-06 12:18:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2248 transitions. [2025-02-06 12:18:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2248 transitions. [2025-02-06 12:18:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:18:06,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:06,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:06,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:18:06,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:06,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:06,602 INFO L85 PathProgramCache]: Analyzing trace with hash -878146438, now seen corresponding path program 1 times [2025-02-06 12:18:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531776190] [2025-02-06 12:18:06,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:06,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:18:06,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:18:06,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:06,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531776190] [2025-02-06 12:18:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531776190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:18:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768142531] [2025-02-06 12:18:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:06,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:18:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:06,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:18:06,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:18:06,673 INFO L87 Difference]: Start difference. First operand 1805 states and 2248 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:06,795 INFO L93 Difference]: Finished difference Result 1787 states and 2223 transitions. [2025-02-06 12:18:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:18:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-02-06 12:18:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:06,800 INFO L225 Difference]: With dead ends: 1787 [2025-02-06 12:18:06,800 INFO L226 Difference]: Without dead ends: 1787 [2025-02-06 12:18:06,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:18:06,801 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 41 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4943 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:06,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4943 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:18:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2025-02-06 12:18:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1784. [2025-02-06 12:18:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1217 states have (on average 1.8044371405094495) internal successors, (2196), 1774 states have internal predecessors, (2196), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2220 transitions. [2025-02-06 12:18:06,841 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2220 transitions. Word has length 12 [2025-02-06 12:18:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:06,841 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2220 transitions. [2025-02-06 12:18:06,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2220 transitions. [2025-02-06 12:18:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 12:18:06,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:06,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:06,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:18:06,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:06,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash -411732336, now seen corresponding path program 1 times [2025-02-06 12:18:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:06,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105707596] [2025-02-06 12:18:06,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:06,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:18:06,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:18:06,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:06,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105707596] [2025-02-06 12:18:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105707596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:07,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:18:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201904712] [2025-02-06 12:18:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:07,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:18:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:07,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:18:07,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:18:07,022 INFO L87 Difference]: Start difference. First operand 1784 states and 2220 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:08,446 INFO L93 Difference]: Finished difference Result 2305 states and 2721 transitions. [2025-02-06 12:18:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:18:08,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-02-06 12:18:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:08,451 INFO L225 Difference]: With dead ends: 2305 [2025-02-06 12:18:08,451 INFO L226 Difference]: Without dead ends: 2305 [2025-02-06 12:18:08,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:18:08,453 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 1229 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:08,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 3259 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:18:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-02-06 12:18:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1780. [2025-02-06 12:18:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1217 states have (on average 1.801150369761709) internal successors, (2192), 1770 states have internal predecessors, (2192), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2216 transitions. [2025-02-06 12:18:08,474 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2216 transitions. Word has length 26 [2025-02-06 12:18:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:08,474 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2216 transitions. [2025-02-06 12:18:08,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2216 transitions. [2025-02-06 12:18:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 12:18:08,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:08,477 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] [2025-02-06 12:18:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:18:08,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2135049405, now seen corresponding path program 1 times [2025-02-06 12:18:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785327718] [2025-02-06 12:18:08,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:08,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:18:08,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:18:08,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:08,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785327718] [2025-02-06 12:18:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785327718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:18:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681097061] [2025-02-06 12:18:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:08,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:18:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:08,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:18:08,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:18:08,561 INFO L87 Difference]: Start difference. First operand 1780 states and 2216 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:08,676 INFO L93 Difference]: Finished difference Result 1780 states and 2212 transitions. [2025-02-06 12:18:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:18:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2025-02-06 12:18:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:08,680 INFO L225 Difference]: With dead ends: 1780 [2025-02-06 12:18:08,680 INFO L226 Difference]: Without dead ends: 1780 [2025-02-06 12:18:08,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:18:08,680 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 21 mSDsluCounter, 3273 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4925 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:08,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4925 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:18:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-02-06 12:18:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2025-02-06 12:18:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1217 states have (on average 1.7978635990139689) internal successors, (2188), 1770 states have internal predecessors, (2188), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2212 transitions. [2025-02-06 12:18:08,697 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2212 transitions. Word has length 61 [2025-02-06 12:18:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2212 transitions. [2025-02-06 12:18:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2212 transitions. [2025-02-06 12:18:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 12:18:08,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:08,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:08,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:18:08,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash -518919173, now seen corresponding path program 1 times [2025-02-06 12:18:08,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624709782] [2025-02-06 12:18:08,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:08,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 12:18:08,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 12:18:08,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:08,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624709782] [2025-02-06 12:18:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624709782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:08,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:08,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:18:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362576551] [2025-02-06 12:18:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:08,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:18:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:08,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:18:08,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:08,781 INFO L87 Difference]: Start difference. First operand 1780 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:08,882 INFO L93 Difference]: Finished difference Result 1872 states and 2331 transitions. [2025-02-06 12:18:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:18:08,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 12:18:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:08,886 INFO L225 Difference]: With dead ends: 1872 [2025-02-06 12:18:08,886 INFO L226 Difference]: Without dead ends: 1872 [2025-02-06 12:18:08,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:18:08,887 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 54 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:08,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3305 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:18:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-02-06 12:18:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1872. [2025-02-06 12:18:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1309 states have (on average 1.7624140565317037) internal successors, (2307), 1862 states have internal predecessors, (2307), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2331 transitions. [2025-02-06 12:18:08,917 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2331 transitions. Word has length 69 [2025-02-06 12:18:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2331 transitions. [2025-02-06 12:18:08,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2331 transitions. [2025-02-06 12:18:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 12:18:08,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:08,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:08,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:18:08,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:08,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:08,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1534366581, now seen corresponding path program 1 times [2025-02-06 12:18:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:08,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133640697] [2025-02-06 12:18:08,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:08,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:08,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 12:18:08,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 12:18:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133640697] [2025-02-06 12:18:09,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133640697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:09,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:09,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:18:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709248490] [2025-02-06 12:18:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:09,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:18:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:09,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:18:09,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:18:09,380 INFO L87 Difference]: Start difference. First operand 1872 states and 2331 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:10,442 INFO L93 Difference]: Finished difference Result 1788 states and 2247 transitions. [2025-02-06 12:18:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:18:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 12:18:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:10,454 INFO L225 Difference]: With dead ends: 1788 [2025-02-06 12:18:10,454 INFO L226 Difference]: Without dead ends: 1788 [2025-02-06 12:18:10,455 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-02-06 12:18:10,455 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1560 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:10,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1531 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:18:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-02-06 12:18:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1510. [2025-02-06 12:18:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1031 states have (on average 1.6818622696411252) internal successors, (1734), 1500 states have internal predecessors, (1734), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1758 transitions. [2025-02-06 12:18:10,502 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1758 transitions. Word has length 72 [2025-02-06 12:18:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:10,502 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1758 transitions. [2025-02-06 12:18:10,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1758 transitions. [2025-02-06 12:18:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:18:10,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:10,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:10,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:18:10,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:10,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 346095238, now seen corresponding path program 1 times [2025-02-06 12:18:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844257290] [2025-02-06 12:18:10,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:10,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:18:10,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:18:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:10,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844257290] [2025-02-06 12:18:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844257290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:10,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:18:10,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632785444] [2025-02-06 12:18:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:10,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:18:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:10,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:18:10,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:18:10,731 INFO L87 Difference]: Start difference. First operand 1510 states and 1758 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:11,636 INFO L93 Difference]: Finished difference Result 1509 states and 1757 transitions. [2025-02-06 12:18:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:18:11,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-06 12:18:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:11,640 INFO L225 Difference]: With dead ends: 1509 [2025-02-06 12:18:11,640 INFO L226 Difference]: Without dead ends: 1509 [2025-02-06 12:18:11,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:18:11,640 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 2 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:11,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4598 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:18:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-02-06 12:18:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-02-06 12:18:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1031 states have (on average 1.6808923375363725) internal successors, (1733), 1499 states have internal predecessors, (1733), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1757 transitions. [2025-02-06 12:18:11,658 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1757 transitions. Word has length 77 [2025-02-06 12:18:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1757 transitions. [2025-02-06 12:18:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1757 transitions. [2025-02-06 12:18:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:18:11,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:11,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:18:11,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:11,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 346095239, now seen corresponding path program 1 times [2025-02-06 12:18:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653885606] [2025-02-06 12:18:11,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:11,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:18:11,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:18:11,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:11,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653885606] [2025-02-06 12:18:11,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653885606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:11,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:18:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603170131] [2025-02-06 12:18:11,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:11,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:18:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:11,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:18:11,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:18:11,983 INFO L87 Difference]: Start difference. First operand 1509 states and 1757 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:13,328 INFO L93 Difference]: Finished difference Result 1508 states and 1756 transitions. [2025-02-06 12:18:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:18:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-06 12:18:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:13,332 INFO L225 Difference]: With dead ends: 1508 [2025-02-06 12:18:13,332 INFO L226 Difference]: Without dead ends: 1508 [2025-02-06 12:18:13,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:18:13,332 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 1 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4620 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:13,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4620 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:18:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-06 12:18:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2025-02-06 12:18:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1030 states have (on average 1.6815533980582524) internal successors, (1732), 1498 states have internal predecessors, (1732), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1756 transitions. [2025-02-06 12:18:13,345 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1756 transitions. Word has length 77 [2025-02-06 12:18:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1756 transitions. [2025-02-06 12:18:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:18:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1756 transitions. [2025-02-06 12:18:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:18:13,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:13,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:18:13,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 676454403, now seen corresponding path program 1 times [2025-02-06 12:18:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436095664] [2025-02-06 12:18:13,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:13,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:18:13,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:18:13,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:13,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436095664] [2025-02-06 12:18:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436095664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:13,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:13,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:18:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299267200] [2025-02-06 12:18:13,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:13,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:18:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:13,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:18:13,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:18:13,518 INFO L87 Difference]: Start difference. First operand 1508 states and 1756 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:14,745 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2025-02-06 12:18:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:18:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-02-06 12:18:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:14,749 INFO L225 Difference]: With dead ends: 1520 [2025-02-06 12:18:14,749 INFO L226 Difference]: Without dead ends: 1520 [2025-02-06 12:18:14,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:18:14,750 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 13 mSDsluCounter, 5640 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7200 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:14,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7200 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:18:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-06 12:18:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1514. [2025-02-06 12:18:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1035 states have (on average 1.680193236714976) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-06 12:18:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1769 transitions. [2025-02-06 12:18:14,782 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1769 transitions. Word has length 85 [2025-02-06 12:18:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:14,782 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1769 transitions. [2025-02-06 12:18:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1769 transitions. [2025-02-06 12:18:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:18:14,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:14,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:14,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:18:14,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:14,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 676454404, now seen corresponding path program 1 times [2025-02-06 12:18:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:14,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133051395] [2025-02-06 12:18:14,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:14,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:18:14,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:18:14,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:14,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:15,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:15,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133051395] [2025-02-06 12:18:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133051395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:15,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:18:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746146909] [2025-02-06 12:18:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:15,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:18:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:15,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:18:15,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:18:15,116 INFO L87 Difference]: Start difference. First operand 1514 states and 1769 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:16,293 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2025-02-06 12:18:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:18:16,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-02-06 12:18:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:16,300 INFO L225 Difference]: With dead ends: 1514 [2025-02-06 12:18:16,303 INFO L226 Difference]: Without dead ends: 1514 [2025-02-06 12:18:16,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:18:16,304 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 8 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5909 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:16,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5909 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 12:18:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2025-02-06 12:18:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2025-02-06 12:18:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1035 states have (on average 1.6792270531400966) internal successors, (1738), 1503 states have internal predecessors, (1738), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-06 12:18:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1768 transitions. [2025-02-06 12:18:16,323 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1768 transitions. Word has length 85 [2025-02-06 12:18:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:16,324 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1768 transitions. [2025-02-06 12:18:16,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1768 transitions. [2025-02-06 12:18:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:18:16,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:16,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:18:16,325 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash 824468384, now seen corresponding path program 1 times [2025-02-06 12:18:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250832649] [2025-02-06 12:18:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:16,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:18:16,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:18:16,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:16,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250832649] [2025-02-06 12:18:16,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250832649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306697462] [2025-02-06 12:18:16,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:16,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:16,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:18:16,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:18:16,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:18:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:18:16,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:16,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:16,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 12:18:16,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:16,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:18:16,990 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:18:16,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:18:17,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:18:17,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:17,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:18:17,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:18:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:17,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:17,210 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 12:18:17,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 12:18:17,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306697462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:17,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:18:17,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-02-06 12:18:17,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289962758] [2025-02-06 12:18:17,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:18:17,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:18:17,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:17,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:18:17,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=171, Unknown=4, NotChecked=0, Total=210 [2025-02-06 12:18:17,278 INFO L87 Difference]: Start difference. First operand 1514 states and 1768 transitions. Second operand has 14 states, 12 states have (on average 10.166666666666666) internal successors, (122), 13 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:19,739 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2025-02-06 12:18:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:18:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.166666666666666) internal successors, (122), 13 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-02-06 12:18:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:19,742 INFO L225 Difference]: With dead ends: 1513 [2025-02-06 12:18:19,742 INFO L226 Difference]: Without dead ends: 1513 [2025-02-06 12:18:19,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=374, Unknown=4, NotChecked=0, Total=462 [2025-02-06 12:18:19,743 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 1548 mSDsluCounter, 7808 mSDsCounter, 0 mSdLazyCounter, 5886 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 8808 SdHoareTripleChecker+Invalid, 5912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:19,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 8808 Invalid, 5912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5886 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:18:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-02-06 12:18:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-02-06 12:18:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1035 states have (on average 1.6782608695652175) internal successors, (1737), 1502 states have internal predecessors, (1737), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-06 12:18:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1767 transitions. [2025-02-06 12:18:19,756 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1767 transitions. Word has length 86 [2025-02-06 12:18:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:19,756 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1767 transitions. [2025-02-06 12:18:19,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.166666666666666) internal successors, (122), 13 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1767 transitions. [2025-02-06 12:18:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 12:18:19,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:19,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:19,765 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-02-06 12:18:19,957 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,SelfDestructingSolverStorable14 [2025-02-06 12:18:19,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:19,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash 824468385, now seen corresponding path program 1 times [2025-02-06 12:18:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:19,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869998020] [2025-02-06 12:18:19,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:19,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:18:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:18:20,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:20,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869998020] [2025-02-06 12:18:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869998020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556434777] [2025-02-06 12:18:20,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:20,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:18:20,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:18:20,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 12:18:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 12:18:20,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:20,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:20,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 12:18:20,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:20,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:18:20,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:18:21,004 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:18:21,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:18:21,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:18:21,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:18:21,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:18:21,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:18:21,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:21,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:18:21,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:21,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:18:21,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:18:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:21,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:21,288 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:18:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556434777] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:21,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:18:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-06 12:18:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961518728] [2025-02-06 12:18:21,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:18:21,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:18:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:21,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:18:21,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-06 12:18:21,292 INFO L87 Difference]: Start difference. First operand 1513 states and 1767 transitions. Second operand has 15 states, 12 states have (on average 10.666666666666666) internal successors, (128), 15 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:18:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:24,604 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2025-02-06 12:18:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:18:24,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.666666666666666) internal successors, (128), 15 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2025-02-06 12:18:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:24,607 INFO L225 Difference]: With dead ends: 1520 [2025-02-06 12:18:24,607 INFO L226 Difference]: Without dead ends: 1520 [2025-02-06 12:18:24,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-06 12:18:24,607 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 1544 mSDsluCounter, 6699 mSDsCounter, 0 mSdLazyCounter, 6947 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 7704 SdHoareTripleChecker+Invalid, 6975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 6947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:24,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 7704 Invalid, 6975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 6947 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 12:18:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-06 12:18:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1511. [2025-02-06 12:18:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1034 states have (on average 1.6779497098646035) internal successors, (1735), 1500 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1759 transitions. [2025-02-06 12:18:24,634 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1759 transitions. Word has length 86 [2025-02-06 12:18:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:24,635 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1759 transitions. [2025-02-06 12:18:24,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.666666666666666) internal successors, (128), 15 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:18:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1759 transitions. [2025-02-06 12:18:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 12:18:24,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:24,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:24,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:18:24,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 12:18:24,837 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:24,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash 268284732, now seen corresponding path program 1 times [2025-02-06 12:18:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:24,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611551749] [2025-02-06 12:18:24,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:24,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 12:18:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 12:18:24,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:24,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:25,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611551749] [2025-02-06 12:18:25,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611551749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:25,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:25,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:18:25,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435755732] [2025-02-06 12:18:25,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:25,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:18:25,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:25,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:18:25,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:18:25,195 INFO L87 Difference]: Start difference. First operand 1511 states and 1759 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:27,502 INFO L93 Difference]: Finished difference Result 1524 states and 1778 transitions. [2025-02-06 12:18:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:18:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-02-06 12:18:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:27,506 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 12:18:27,506 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 12:18:27,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:18:27,507 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 1559 mSDsluCounter, 7785 mSDsCounter, 0 mSdLazyCounter, 5883 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 8784 SdHoareTripleChecker+Invalid, 5909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:27,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 8784 Invalid, 5909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5883 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 12:18:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 12:18:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1520. [2025-02-06 12:18:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1042 states have (on average 1.6746641074856046) internal successors, (1745), 1508 states have internal predecessors, (1745), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1770 transitions. [2025-02-06 12:18:27,523 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1770 transitions. Word has length 88 [2025-02-06 12:18:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:27,524 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1770 transitions. [2025-02-06 12:18:27,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1770 transitions. [2025-02-06 12:18:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 12:18:27,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:27,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, 1, 1, 1, 1] [2025-02-06 12:18:27,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:18:27,527 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:27,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 268284733, now seen corresponding path program 1 times [2025-02-06 12:18:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098025999] [2025-02-06 12:18:27,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:27,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 12:18:27,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 12:18:27,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:27,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098025999] [2025-02-06 12:18:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098025999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:27,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:27,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:18:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814990048] [2025-02-06 12:18:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:18:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:27,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:18:27,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:18:27,900 INFO L87 Difference]: Start difference. First operand 1520 states and 1770 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:31,076 INFO L93 Difference]: Finished difference Result 1523 states and 1777 transitions. [2025-02-06 12:18:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:18:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-02-06 12:18:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:31,078 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 12:18:31,078 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 12:18:31,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:18:31,080 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 1551 mSDsluCounter, 6681 mSDsCounter, 0 mSdLazyCounter, 6961 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 7687 SdHoareTripleChecker+Invalid, 6985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:31,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 7687 Invalid, 6985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6961 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 12:18:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 12:18:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2025-02-06 12:18:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1042 states have (on average 1.673704414587332) internal successors, (1744), 1508 states have internal predecessors, (1744), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1769 transitions. [2025-02-06 12:18:31,092 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1769 transitions. Word has length 88 [2025-02-06 12:18:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:31,092 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1769 transitions. [2025-02-06 12:18:31,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1769 transitions. [2025-02-06 12:18:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 12:18:31,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:31,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:18:31,093 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1178620289, now seen corresponding path program 1 times [2025-02-06 12:18:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567649432] [2025-02-06 12:18:31,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:31,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:18:31,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:18:31,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:31,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:31,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567649432] [2025-02-06 12:18:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567649432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650335393] [2025-02-06 12:18:31,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:31,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:31,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:31,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:18:31,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:18:31,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:18:31,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:18:31,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:31,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:31,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 12:18:31,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:31,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:18:31,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:18:31,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:18:31,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:18:31,736 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:31,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:18:31,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:31,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:18:31,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:18:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:31,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:31,806 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_924) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:18:31,854 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-06 12:18:31,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-02-06 12:18:31,858 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int)) (v_ArrVal_927 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_927))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_924)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-06 12:18:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650335393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:31,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:18:31,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-02-06 12:18:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144684503] [2025-02-06 12:18:31,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:18:31,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:18:31,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:31,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:18:31,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=256, Unknown=4, NotChecked=66, Total=380 [2025-02-06 12:18:31,864 INFO L87 Difference]: Start difference. First operand 1520 states and 1769 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:34,412 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2025-02-06 12:18:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:18:34,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2025-02-06 12:18:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:34,415 INFO L225 Difference]: With dead ends: 1522 [2025-02-06 12:18:34,415 INFO L226 Difference]: Without dead ends: 1522 [2025-02-06 12:18:34,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=496, Unknown=4, NotChecked=94, Total=702 [2025-02-06 12:18:34,415 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 1552 mSDsluCounter, 8760 mSDsCounter, 0 mSdLazyCounter, 6475 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 9759 SdHoareTripleChecker+Invalid, 6512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 6475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:34,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 9759 Invalid, 6512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 6475 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:18:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-02-06 12:18:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1519. [2025-02-06 12:18:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1042 states have (on average 1.6727447216890594) internal successors, (1743), 1507 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2025-02-06 12:18:34,440 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 89 [2025-02-06 12:18:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:34,440 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2025-02-06 12:18:34,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 17 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2025-02-06 12:18:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 12:18:34,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:34,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:34,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:18:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:34,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:34,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1178620288, now seen corresponding path program 1 times [2025-02-06 12:18:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584871327] [2025-02-06 12:18:34,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:34,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:18:34,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:18:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584871327] [2025-02-06 12:18:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584871327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223019191] [2025-02-06 12:18:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:35,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:35,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:18:35,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:18:35,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 12:18:35,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 12:18:35,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:35,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 12:18:35,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:35,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:18:35,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:18:35,386 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:18:35,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:18:35,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:18:35,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:18:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:18:35,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:18:35,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:35,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:18:35,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:35,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:35,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:18:35,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:35,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:18:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:18:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:35,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:35,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1068 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:18:35,728 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1068 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:18:35,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1074))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1073) .cse0 v_ArrVal_1068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1074 (Array Int Int)) (v_ArrVal_1073 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1073) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-02-06 12:18:35,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223019191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:35,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:18:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-06 12:18:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592634119] [2025-02-06 12:18:35,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:18:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:18:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:35,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:18:35,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2025-02-06 12:18:35,766 INFO L87 Difference]: Start difference. First operand 1519 states and 1768 transitions. Second operand has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 20 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-02-06 12:18:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:40,948 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2025-02-06 12:18:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:18:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 20 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 89 [2025-02-06 12:18:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:40,950 INFO L225 Difference]: With dead ends: 1521 [2025-02-06 12:18:40,951 INFO L226 Difference]: Without dead ends: 1521 [2025-02-06 12:18:40,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2025-02-06 12:18:40,952 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 1544 mSDsluCounter, 10479 mSDsCounter, 0 mSdLazyCounter, 11291 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 11483 SdHoareTripleChecker+Invalid, 11318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 11291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:40,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 11483 Invalid, 11318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 11291 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-06 12:18:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-02-06 12:18:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1509. [2025-02-06 12:18:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1034 states have (on average 1.6760154738878144) internal successors, (1733), 1498 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1757 transitions. [2025-02-06 12:18:40,969 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1757 transitions. Word has length 89 [2025-02-06 12:18:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1757 transitions. [2025-02-06 12:18:40,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.235294117647058) internal successors, (140), 20 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-02-06 12:18:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1757 transitions. [2025-02-06 12:18:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 12:18:40,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:40,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:40,982 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-02-06 12:18:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:41,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:41,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash -461976004, now seen corresponding path program 1 times [2025-02-06 12:18:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26765808] [2025-02-06 12:18:41,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:41,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:41,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 12:18:41,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 12:18:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26765808] [2025-02-06 12:18:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26765808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:41,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:41,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:18:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232351031] [2025-02-06 12:18:41,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:41,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:18:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:41,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:18:41,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:18:41,658 INFO L87 Difference]: Start difference. First operand 1509 states and 1757 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:44,686 INFO L93 Difference]: Finished difference Result 1525 states and 1779 transitions. [2025-02-06 12:18:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:18:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-02-06 12:18:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:44,690 INFO L225 Difference]: With dead ends: 1525 [2025-02-06 12:18:44,690 INFO L226 Difference]: Without dead ends: 1525 [2025-02-06 12:18:44,690 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-02-06 12:18:44,693 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1571 mSDsluCounter, 11671 mSDsCounter, 0 mSdLazyCounter, 8459 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 12669 SdHoareTripleChecker+Invalid, 8484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:44,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 12669 Invalid, 8484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 8459 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 12:18:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-06 12:18:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1521. [2025-02-06 12:18:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1045 states have (on average 1.6708133971291865) internal successors, (1746), 1509 states have internal predecessors, (1746), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1771 transitions. [2025-02-06 12:18:44,714 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1771 transitions. Word has length 91 [2025-02-06 12:18:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1771 transitions. [2025-02-06 12:18:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1771 transitions. [2025-02-06 12:18:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 12:18:44,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:44,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:44,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:18:44,715 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:44,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -461976003, now seen corresponding path program 1 times [2025-02-06 12:18:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225029159] [2025-02-06 12:18:44,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:44,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 12:18:44,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 12:18:44,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:44,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225029159] [2025-02-06 12:18:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225029159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:45,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:45,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:18:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173485396] [2025-02-06 12:18:45,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:18:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:45,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:18:45,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:18:45,478 INFO L87 Difference]: Start difference. First operand 1521 states and 1771 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:47,970 INFO L93 Difference]: Finished difference Result 1524 states and 1778 transitions. [2025-02-06 12:18:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:18:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-02-06 12:18:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:47,976 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 12:18:47,976 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 12:18:47,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:18:47,978 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 1570 mSDsluCounter, 5924 mSDsCounter, 0 mSdLazyCounter, 6055 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 6929 SdHoareTripleChecker+Invalid, 6079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:47,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 6929 Invalid, 6079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6055 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:18:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 12:18:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1521. [2025-02-06 12:18:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1045 states have (on average 1.6698564593301435) internal successors, (1745), 1509 states have internal predecessors, (1745), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1770 transitions. [2025-02-06 12:18:47,996 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1770 transitions. Word has length 91 [2025-02-06 12:18:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:47,997 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1770 transitions. [2025-02-06 12:18:47,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1770 transitions. [2025-02-06 12:18:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 12:18:47,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:47,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:47,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:18:47,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:47,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:47,998 INFO L85 PathProgramCache]: Analyzing trace with hash -917673959, now seen corresponding path program 1 times [2025-02-06 12:18:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:47,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448089555] [2025-02-06 12:18:47,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:47,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:48,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:18:48,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:18:48,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:48,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448089555] [2025-02-06 12:18:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448089555] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533474219] [2025-02-06 12:18:48,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:48,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:48,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:48,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:18:48,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:18:48,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:18:48,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:18:48,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:48,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:48,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 12:18:48,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:48,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:18:48,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:18:48,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:18:48,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:18:48,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:48,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:18:48,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:48,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:18:48,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:48,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:18:48,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:18:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:48,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:48,931 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1356) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:18:48,937 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1355))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1356)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:18:48,987 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-06 12:18:48,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2025-02-06 12:18:48,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1359))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1355)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1356)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-06 12:18:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533474219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:48,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:18:48,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-06 12:18:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462210520] [2025-02-06 12:18:48,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:18:48,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:18:48,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:48,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:18:48,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=347, Unknown=15, NotChecked=120, Total=552 [2025-02-06 12:18:48,994 INFO L87 Difference]: Start difference. First operand 1521 states and 1770 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 19 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:52,004 INFO L93 Difference]: Finished difference Result 1523 states and 1777 transitions. [2025-02-06 12:18:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:18:52,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 19 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-02-06 12:18:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:52,007 INFO L225 Difference]: With dead ends: 1523 [2025-02-06 12:18:52,007 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 12:18:52,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=673, Unknown=15, NotChecked=168, Total=992 [2025-02-06 12:18:52,008 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1544 mSDsluCounter, 10695 mSDsCounter, 0 mSdLazyCounter, 7813 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 11693 SdHoareTripleChecker+Invalid, 7850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 7813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:52,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 11693 Invalid, 7850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 7813 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 12:18:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 12:18:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2025-02-06 12:18:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1045 states have (on average 1.6688995215311004) internal successors, (1744), 1508 states have internal predecessors, (1744), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1769 transitions. [2025-02-06 12:18:52,021 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1769 transitions. Word has length 92 [2025-02-06 12:18:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:52,021 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1769 transitions. [2025-02-06 12:18:52,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 19 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1769 transitions. [2025-02-06 12:18:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 12:18:52,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:52,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:52,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:18:52,225 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,SelfDestructingSolverStorable22 [2025-02-06 12:18:52,225 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:52,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash -917673958, now seen corresponding path program 1 times [2025-02-06 12:18:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286540549] [2025-02-06 12:18:52,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:52,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:18:52,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:18:52,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:52,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:53,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286540549] [2025-02-06 12:18:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286540549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697698592] [2025-02-06 12:18:53,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:53,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:53,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:18:53,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:18:53,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 12:18:53,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 12:18:53,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:53,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:53,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 12:18:53,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:53,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:18:53,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:18:53,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:18:53,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:18:53,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:18:53,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:18:53,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:18:53,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:18:53,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:53,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:18:53,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:53,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:53,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:18:53,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:53,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:53,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 62 treesize of output 57 [2025-02-06 12:18:53,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:53,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:18:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:18:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:53,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:53,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1513 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1513 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:18:53,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1513 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1511))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1512) .cse0 v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1513 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1512) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-02-06 12:18:53,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1513 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1512) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1513 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1511))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1512) .cse2 v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-06 12:18:53,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1514 (Array Int Int)) (v_ArrVal_1513 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1519))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1511))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1520) .cse0 v_ArrVal_1512) .cse1 v_ArrVal_1513) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1513 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1520 (Array Int Int)) (v_ArrVal_1519 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1519))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1520) .cse5 v_ArrVal_1512) (select (select (store .cse6 .cse5 v_ArrVal_1511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1513))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-06 12:18:53,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697698592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:53,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:18:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-02-06 12:18:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720624447] [2025-02-06 12:18:53,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:18:53,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:18:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:53,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:18:53,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=346, Unknown=11, NotChecked=164, Total=600 [2025-02-06 12:18:53,868 INFO L87 Difference]: Start difference. First operand 1520 states and 1769 transitions. Second operand has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:56,841 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2025-02-06 12:18:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:18:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-02-06 12:18:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:56,843 INFO L225 Difference]: With dead ends: 1522 [2025-02-06 12:18:56,844 INFO L226 Difference]: Without dead ends: 1522 [2025-02-06 12:18:56,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=577, Unknown=12, NotChecked=212, Total=930 [2025-02-06 12:18:56,844 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 1545 mSDsluCounter, 7437 mSDsCounter, 0 mSdLazyCounter, 7854 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 8440 SdHoareTripleChecker+Invalid, 7893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:56,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 8440 Invalid, 7893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7854 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 12:18:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-02-06 12:18:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1507. [2025-02-06 12:18:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1034 states have (on average 1.6740812379110253) internal successors, (1731), 1496 states have internal predecessors, (1731), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:18:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1755 transitions. [2025-02-06 12:18:56,858 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1755 transitions. Word has length 92 [2025-02-06 12:18:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:56,858 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1755 transitions. [2025-02-06 12:18:56,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5625) internal successors, (137), 18 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:18:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1755 transitions. [2025-02-06 12:18:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:18:56,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:56,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:56,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:18:57,064 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,SelfDestructingSolverStorable23 [2025-02-06 12:18:57,064 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:57,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1650214891, now seen corresponding path program 1 times [2025-02-06 12:18:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369161201] [2025-02-06 12:18:57,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:57,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:18:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:18:57,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:57,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:18:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369161201] [2025-02-06 12:18:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369161201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 12:18:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955951772] [2025-02-06 12:18:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:18:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:57,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:18:57,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:18:57,454 INFO L87 Difference]: Start difference. First operand 1507 states and 1755 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:59,538 INFO L93 Difference]: Finished difference Result 1526 states and 1780 transitions. [2025-02-06 12:18:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:18:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-02-06 12:18:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:59,541 INFO L225 Difference]: With dead ends: 1526 [2025-02-06 12:18:59,541 INFO L226 Difference]: Without dead ends: 1526 [2025-02-06 12:18:59,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:18:59,541 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1574 mSDsluCounter, 7786 mSDsCounter, 0 mSdLazyCounter, 5856 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 8783 SdHoareTripleChecker+Invalid, 5881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:59,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 8783 Invalid, 5881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5856 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 12:18:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2025-02-06 12:18:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1522. [2025-02-06 12:18:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1048 states have (on average 1.6669847328244274) internal successors, (1747), 1510 states have internal predecessors, (1747), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:18:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1772 transitions. [2025-02-06 12:18:59,556 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1772 transitions. Word has length 94 [2025-02-06 12:18:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1772 transitions. [2025-02-06 12:18:59,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:18:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1772 transitions. [2025-02-06 12:18:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:18:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:59,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:59,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 12:18:59,557 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:18:59,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1650214890, now seen corresponding path program 1 times [2025-02-06 12:18:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962941950] [2025-02-06 12:18:59,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:18:59,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:18:59,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:59,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:00,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:19:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962941950] [2025-02-06 12:19:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962941950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:19:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:19:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:19:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632562398] [2025-02-06 12:19:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:19:00,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:19:00,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:19:00,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:19:00,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:19:00,115 INFO L87 Difference]: Start difference. First operand 1522 states and 1772 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:19:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:19:02,146 INFO L93 Difference]: Finished difference Result 1525 states and 1779 transitions. [2025-02-06 12:19:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:19:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-02-06 12:19:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:19:02,149 INFO L225 Difference]: With dead ends: 1525 [2025-02-06 12:19:02,149 INFO L226 Difference]: Without dead ends: 1525 [2025-02-06 12:19:02,149 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-02-06 12:19:02,152 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 1553 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 5438 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 5991 SdHoareTripleChecker+Invalid, 5462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:19:02,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 5991 Invalid, 5462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5438 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:19:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-06 12:19:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1522. [2025-02-06 12:19:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1048 states have (on average 1.666030534351145) internal successors, (1746), 1510 states have internal predecessors, (1746), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:19:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1771 transitions. [2025-02-06 12:19:02,167 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1771 transitions. Word has length 94 [2025-02-06 12:19:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:19:02,168 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1771 transitions. [2025-02-06 12:19:02,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:19:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1771 transitions. [2025-02-06 12:19:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:19:02,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:19:02,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:19:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 12:19:02,169 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:19:02,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:19:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash -956369640, now seen corresponding path program 1 times [2025-02-06 12:19:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:19:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560661989] [2025-02-06 12:19:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:19:02,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:19:02,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:19:02,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:02,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:19:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560661989] [2025-02-06 12:19:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560661989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:19:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192582492] [2025-02-06 12:19:02,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:19:02,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:19:02,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:19:02,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:19:02,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:19:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:19:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:02,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 12:19:02,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:19:02,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:19:02,812 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:19:02,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:19:02,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:19:02,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:02,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:02,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:02,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:02,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:02,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:02,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:02,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:02,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:19:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:02,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:19:02,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1827 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1827) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:19:03,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1826))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1827)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:07,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1825))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1826)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1827)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:07,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1825))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1826)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1827)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:07,124 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-06 12:19:07,125 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 105 treesize of output 104 [2025-02-06 12:19:07,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1826 (Array Int Int)) (v_ArrVal_1825 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1830))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1825)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1826)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1827)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-06 12:19:07,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192582492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:19:07,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:19:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2025-02-06 12:19:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431153529] [2025-02-06 12:19:07,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:19:07,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:19:07,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:19:07,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:19:07,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=455, Unknown=23, NotChecked=240, Total=812 [2025-02-06 12:19:07,134 INFO L87 Difference]: Start difference. First operand 1522 states and 1771 transitions. Second operand has 22 states, 19 states have (on average 7.578947368421052) internal successors, (144), 22 states have internal predecessors, (144), 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-02-06 12:19:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:19:10,966 INFO L93 Difference]: Finished difference Result 1524 states and 1778 transitions. [2025-02-06 12:19:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:19:10,966 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.578947368421052) internal successors, (144), 22 states have internal predecessors, (144), 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 95 [2025-02-06 12:19:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:19:10,968 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 12:19:10,971 INFO L226 Difference]: Without dead ends: 1524 [2025-02-06 12:19:10,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=178, Invalid=875, Unknown=23, NotChecked=330, Total=1406 [2025-02-06 12:19:10,972 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1544 mSDsluCounter, 9709 mSDsCounter, 0 mSdLazyCounter, 7179 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 10706 SdHoareTripleChecker+Invalid, 7218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:19:10,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 10706 Invalid, 7218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7179 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-06 12:19:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-02-06 12:19:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1521. [2025-02-06 12:19:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1048 states have (on average 1.6650763358778626) internal successors, (1745), 1509 states have internal predecessors, (1745), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:19:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1770 transitions. [2025-02-06 12:19:10,991 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1770 transitions. Word has length 95 [2025-02-06 12:19:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:19:10,992 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 1770 transitions. [2025-02-06 12:19:10,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.578947368421052) internal successors, (144), 22 states have internal predecessors, (144), 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-02-06 12:19:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1770 transitions. [2025-02-06 12:19:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 12:19:10,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:19:10,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:19:11,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:19:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:19:11,193 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:19:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:19:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash -956369639, now seen corresponding path program 1 times [2025-02-06 12:19:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:19:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908160320] [2025-02-06 12:19:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:11,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:19:11,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:19:11,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:19:11,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:11,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:11,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:19:11,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908160320] [2025-02-06 12:19:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908160320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:19:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526185673] [2025-02-06 12:19:11,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:11,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:19:11,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:19:11,761 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:19:11,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:19:11,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 12:19:11,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 12:19:11,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:11,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:11,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 12:19:11,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:19:11,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:19:12,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:19:12,167 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:19:12,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:19:12,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:19:12,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:19:12,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:19:12,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:19:12,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:12,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:19:12,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:19:12,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:19:12,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 45 [2025-02-06 12:19:12,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:19:12,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:12,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:19:12,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:19:12,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:12,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 12:19:12,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:19:12,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:19:12,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 12:19:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:12,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:19:12,852 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1997 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1997))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int))) (<= 0 (+ 20 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_1998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1997 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_1997))) (or (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_1998))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse3 .cse4 v_ArrVal_1999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0))))))) is different from false [2025-02-06 12:19:12,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 16))) (and (forall ((v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse4 .cse5 v_ArrVal_1996)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1995) .cse3 v_ArrVal_1997))) (or (< (+ 8 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_1998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))))) (forall ((v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse4 .cse5 v_ArrVal_1996)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1995) .cse10 v_ArrVal_1997))) (or (< (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_1998))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse6 .cse7 v_ArrVal_1999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2025-02-06 12:19:13,346 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem52#1.offset_21| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2005))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_21| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (forall ((v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2006))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse8 .cse7 (store (select .cse8 .cse7) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_21| 16) v_ArrVal_1996)))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store .cse0 .cse7 v_ArrVal_1995) .cse6 v_ArrVal_1997))) (or (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_1998))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_1999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem52#1.offset_21| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2005))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_21| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (forall ((v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2006))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 (store (select .cse14 .cse13) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_21| 16) v_ArrVal_1996)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store .cse9 .cse13 v_ArrVal_1995) .cse12 v_ArrVal_1997))) (or (< (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) 0) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_1998 (Array Int Int))) (<= 0 (+ (select (select (store .cse10 (select (select (store .cse11 .cse12 v_ArrVal_1998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))))))))))))) is different from false [2025-02-06 12:19:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526185673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:19:13,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:19:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-02-06 12:19:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210132665] [2025-02-06 12:19:13,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:19:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:19:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:19:13,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:19:13,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=731, Unknown=19, NotChecked=174, Total=1056 [2025-02-06 12:19:13,351 INFO L87 Difference]: Start difference. First operand 1521 states and 1770 transitions. Second operand has 24 states, 21 states have (on average 8.714285714285714) internal successors, (183), 24 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:19:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:19:18,198 INFO L93 Difference]: Finished difference Result 2398 states and 2828 transitions. [2025-02-06 12:19:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:19:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 8.714285714285714) internal successors, (183), 24 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-02-06 12:19:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:19:18,203 INFO L225 Difference]: With dead ends: 2398 [2025-02-06 12:19:18,203 INFO L226 Difference]: Without dead ends: 2398 [2025-02-06 12:19:18,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1178, Unknown=19, NotChecked=222, Total=1640 [2025-02-06 12:19:18,204 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 2571 mSDsluCounter, 9692 mSDsCounter, 0 mSdLazyCounter, 10014 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 10693 SdHoareTripleChecker+Invalid, 10059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 10014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:19:18,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 10693 Invalid, 10059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 10014 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 12:19:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-02-06 12:19:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 1505. [2025-02-06 12:19:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1034 states have (on average 1.672147001934236) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 12:19:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1753 transitions. [2025-02-06 12:19:18,216 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1753 transitions. Word has length 95 [2025-02-06 12:19:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:19:18,217 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1753 transitions. [2025-02-06 12:19:18,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 8.714285714285714) internal successors, (183), 24 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:19:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1753 transitions. [2025-02-06 12:19:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:19:18,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:19:18,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:19:18,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:19:18,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 12:19:18,418 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:19:18,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:19:18,418 INFO L85 PathProgramCache]: Analyzing trace with hash 961699087, now seen corresponding path program 1 times [2025-02-06 12:19:18,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:19:18,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047536231] [2025-02-06 12:19:18,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:18,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:19:18,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:19:18,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:19:18,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:18,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:19:18,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047536231] [2025-02-06 12:19:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047536231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:19:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:19:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:19:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361795236] [2025-02-06 12:19:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:19:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:19:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:19:18,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:19:18,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:19:18,859 INFO L87 Difference]: Start difference. First operand 1505 states and 1753 transitions. Second operand has 14 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-02-06 12:19:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:19:21,162 INFO L93 Difference]: Finished difference Result 1528 states and 1782 transitions. [2025-02-06 12:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:19:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 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-02-06 12:19:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:19:21,164 INFO L225 Difference]: With dead ends: 1528 [2025-02-06 12:19:21,164 INFO L226 Difference]: Without dead ends: 1528 [2025-02-06 12:19:21,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:19:21,164 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 1575 mSDsluCounter, 6779 mSDsCounter, 0 mSdLazyCounter, 5221 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 7781 SdHoareTripleChecker+Invalid, 5248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:19:21,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 7781 Invalid, 5248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5221 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 12:19:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-02-06 12:19:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1524. [2025-02-06 12:19:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1052 states have (on average 1.6625475285171103) internal successors, (1749), 1512 states have internal predecessors, (1749), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:19:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1774 transitions. [2025-02-06 12:19:21,176 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1774 transitions. Word has length 98 [2025-02-06 12:19:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:19:21,176 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1774 transitions. [2025-02-06 12:19:21,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 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-02-06 12:19:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1774 transitions. [2025-02-06 12:19:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 12:19:21,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:19:21,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:19:21,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 12:19:21,177 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:19:21,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:19:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 961699088, now seen corresponding path program 1 times [2025-02-06 12:19:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:19:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343594368] [2025-02-06 12:19:21,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:19:21,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 12:19:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 12:19:21,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:21,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:19:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343594368] [2025-02-06 12:19:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343594368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:19:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:19:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 12:19:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912394653] [2025-02-06 12:19:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:19:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:19:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:19:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:19:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:19:21,928 INFO L87 Difference]: Start difference. First operand 1524 states and 1774 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:19:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:19:28,091 INFO L93 Difference]: Finished difference Result 1527 states and 1781 transitions. [2025-02-06 12:19:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:19:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-02-06 12:19:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:19:28,094 INFO L225 Difference]: With dead ends: 1527 [2025-02-06 12:19:28,097 INFO L226 Difference]: Without dead ends: 1527 [2025-02-06 12:19:28,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:19:28,098 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1554 mSDsluCounter, 11108 mSDsCounter, 0 mSdLazyCounter, 12280 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 12105 SdHoareTripleChecker+Invalid, 12308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:19:28,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 12105 Invalid, 12308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 12280 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-02-06 12:19:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-02-06 12:19:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1524. [2025-02-06 12:19:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1052 states have (on average 1.661596958174905) internal successors, (1748), 1512 states have internal predecessors, (1748), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2025-02-06 12:19:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1773 transitions. [2025-02-06 12:19:28,107 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1773 transitions. Word has length 98 [2025-02-06 12:19:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:19:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 1773 transitions. [2025-02-06 12:19:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 17 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:19:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1773 transitions. [2025-02-06 12:19:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:19:28,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:19:28,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:19:28,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:19:28,109 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2025-02-06 12:19:28,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:19:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1729011566, now seen corresponding path program 1 times [2025-02-06 12:19:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:19:28,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910360440] [2025-02-06 12:19:28,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:19:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:19:28,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:19:28,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:28,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:19:28,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910360440] [2025-02-06 12:19:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910360440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:19:28,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937059385] [2025-02-06 12:19:28,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:19:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:19:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:19:28,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:19:28,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:19:28,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:19:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:19:28,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:19:28,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:19:28,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 12:19:28,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:19:28,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:19:29,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:19:29,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:19:29,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:19:29,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:29,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:29,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:29,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:29,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:29,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:29,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:29,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:19:29,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:19:29,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:19:29,256 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 12:19:29,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-06 12:19:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:19:29,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:19:29,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-06 12:19:29,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2346) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:19:29,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2345))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2346)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:29,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2345))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2346)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:29,335 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2344 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2344))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2345)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2346)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:29,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2344 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2344))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2345)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2346)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:19:29,480 INFO L349 Elim1Store]: treesize reduction 5, result has 97.5 percent of original size [2025-02-06 12:19:29,480 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 201 treesize of output 200 [2025-02-06 12:19:29,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2350))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2343)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2344)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2345)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2346)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-06 12:19:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937059385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:19:29,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:19:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2025-02-06 12:19:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336370700] [2025-02-06 12:19:29,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:19:29,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:19:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:19:29,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:19:29,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=413, Unknown=27, NotChecked=336, Total=870 [2025-02-06 12:19:29,490 INFO L87 Difference]: Start difference. First operand 1524 states and 1773 transitions. Second operand has 21 states, 19 states have (on average 7.421052631578948) internal successors, (141), 20 states have internal predecessors, (141), 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)