./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:16:46,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:16:46,816 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:16:46,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:16:46,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:16:46,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:16:46,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:16:46,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:16:46,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:16:46,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:16:46,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:16:46,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:16:46,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:16:46,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:16:46,849 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:16:46,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:16:46,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:16:46,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:16:46,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:16:46,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:16:46,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:16:46,852 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2025-02-06 12:16:47,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:16:47,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:16:47,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:16:47,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:16:47,082 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:16:47,083 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_test2-1.i [2025-02-06 12:16:48,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b1ed32d5/29cd9e588e7948d58d4c22279b840287/FLAGecb1d1756 [2025-02-06 12:16:48,589 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:16:48,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2025-02-06 12:16:48,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b1ed32d5/29cd9e588e7948d58d4c22279b840287/FLAGecb1d1756 [2025-02-06 12:16:48,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b1ed32d5/29cd9e588e7948d58d4c22279b840287 [2025-02-06 12:16:48,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:16:48,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:16:48,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:16:48,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:16:48,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:16:48,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:16:48" (1/1) ... [2025-02-06 12:16:48,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdb535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:48, skipping insertion in model container [2025-02-06 12:16:48,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:16:48" (1/1) ... [2025-02-06 12:16:48,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:16:48,956 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:16:48,986 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:16:48,990 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:16:48,993 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:16:48,997 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:16:49,015 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:16:49,015 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:16:49,017 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:16:49,017 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:16:49,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:16:49,032 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:16:49,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:16:49,113 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:16:49,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49 WrapperNode [2025-02-06 12:16:49,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:16:49,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:16:49,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:16:49,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:16:49,118 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:16:49" (1/1) ... [2025-02-06 12:16:49,132 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:16:49" (1/1) ... [2025-02-06 12:16:49,170 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1274 [2025-02-06 12:16:49,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:16:49,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:16:49,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:16:49,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:16:49,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,235 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-06 12:16:49,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:16:49,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:16:49,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:16:49,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:16:49,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (1/1) ... [2025-02-06 12:16:49,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:16:49,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:16:49,311 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:16:49,320 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:16:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 12:16:49,331 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 12:16:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 12:16:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 12:16:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 12:16:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 12:16:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 12:16:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:16:49,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 12:16:49,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:16:49,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:16:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:16:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:16:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:16:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:16:49,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:16:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:16:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:16:49,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:16:49,502 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:16:49,504 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:16:50,749 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 12:16:50,825 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-02-06 12:16:50,826 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:16:50,865 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:16:50,865 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 12:16:50,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:16:50 BoogieIcfgContainer [2025-02-06 12:16:50,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:16:50,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:16:50,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:16:50,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:16:50,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:16:48" (1/3) ... [2025-02-06 12:16:50,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555d2695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:16:50, skipping insertion in model container [2025-02-06 12:16:50,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:16:49" (2/3) ... [2025-02-06 12:16:50,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555d2695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:16:50, skipping insertion in model container [2025-02-06 12:16:50,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:16:50" (3/3) ... [2025-02-06 12:16:50,871 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2025-02-06 12:16:50,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:16:50,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test2-1.i that has 6 procedures, 1095 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2025-02-06 12:16:50,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:16:50,919 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;@654faae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:16:50,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2025-02-06 12:16:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 650 states have (on average 1.9923076923076923) internal successors, (1295), 1078 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 12:16:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:16:50,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:50,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:16:50,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1386195, now seen corresponding path program 1 times [2025-02-06 12:16:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:50,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644915493] [2025-02-06 12:16:50,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:50,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:16:50,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:16:50,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:50,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:51,032 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:16:51,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:51,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644915493] [2025-02-06 12:16:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644915493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:51,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490990234] [2025-02-06 12:16:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:51,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:51,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:51,065 INFO L87 Difference]: Start difference. First operand has 1085 states, 650 states have (on average 1.9923076923076923) internal successors, (1295), 1078 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:51,598 INFO L93 Difference]: Finished difference Result 1071 states and 1245 transitions. [2025-02-06 12:16:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:16:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:51,608 INFO L225 Difference]: With dead ends: 1071 [2025-02-06 12:16:51,608 INFO L226 Difference]: Without dead ends: 1069 [2025-02-06 12:16:51,610 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:16:51,611 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1110 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:51,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 867 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:16:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-02-06 12:16:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-02-06 12:16:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 652 states have (on average 1.8788343558282208) internal successors, (1225), 1062 states have internal predecessors, (1225), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 12:16:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1243 transitions. [2025-02-06 12:16:51,658 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1243 transitions. Word has length 3 [2025-02-06 12:16:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:51,658 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1243 transitions. [2025-02-06 12:16:51,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1243 transitions. [2025-02-06 12:16:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:16:51,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:51,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:16:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:16:51,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:51,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1386196, now seen corresponding path program 1 times [2025-02-06 12:16:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:51,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341593559] [2025-02-06 12:16:51,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:51,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:16:51,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:16:51,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:51,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:51,738 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:16:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341593559] [2025-02-06 12:16:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341593559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:51,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:51,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413048377] [2025-02-06 12:16:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:51,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:51,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:51,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:51,740 INFO L87 Difference]: Start difference. First operand 1069 states and 1243 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:52,567 INFO L93 Difference]: Finished difference Result 1851 states and 2187 transitions. [2025-02-06 12:16:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:52,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:16:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:52,573 INFO L225 Difference]: With dead ends: 1851 [2025-02-06 12:16:52,573 INFO L226 Difference]: Without dead ends: 1851 [2025-02-06 12:16:52,573 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:16:52,574 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 926 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:52,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1680 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:16:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2025-02-06 12:16:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1587. [2025-02-06 12:16:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1166 states have (on average 1.8396226415094339) internal successors, (2145), 1578 states have internal predecessors, (2145), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2177 transitions. [2025-02-06 12:16:52,609 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2177 transitions. Word has length 3 [2025-02-06 12:16:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:52,610 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2177 transitions. [2025-02-06 12:16:52,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2177 transitions. [2025-02-06 12:16:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:16:52,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:52,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:16:52,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash -873756727, now seen corresponding path program 1 times [2025-02-06 12:16:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435320459] [2025-02-06 12:16:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:52,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:16:52,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:16:52,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:52,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:52,654 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:16:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435320459] [2025-02-06 12:16:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435320459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722293794] [2025-02-06 12:16:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:52,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:52,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:52,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:52,656 INFO L87 Difference]: Start difference. First operand 1587 states and 2177 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:53,202 INFO L93 Difference]: Finished difference Result 1865 states and 2519 transitions. [2025-02-06 12:16:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:16:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:53,207 INFO L225 Difference]: With dead ends: 1865 [2025-02-06 12:16:53,207 INFO L226 Difference]: Without dead ends: 1865 [2025-02-06 12:16:53,208 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:16:53,208 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 1095 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:53,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1441 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:16:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2025-02-06 12:16:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1540. [2025-02-06 12:16:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1166 states have (on average 1.7787307032590052) internal successors, (2074), 1531 states have internal predecessors, (2074), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2106 transitions. [2025-02-06 12:16:53,232 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2106 transitions. Word has length 9 [2025-02-06 12:16:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:53,232 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2106 transitions. [2025-02-06 12:16:53,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2106 transitions. [2025-02-06 12:16:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:16:53,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:53,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:53,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:16:53,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -873756726, now seen corresponding path program 1 times [2025-02-06 12:16:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005043148] [2025-02-06 12:16:53,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:53,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:16:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:16:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:53,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005043148] [2025-02-06 12:16:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005043148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:16:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817402139] [2025-02-06 12:16:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:53,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:53,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:53,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:53,302 INFO L87 Difference]: Start difference. First operand 1540 states and 2106 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:53,862 INFO L93 Difference]: Finished difference Result 2090 states and 2892 transitions. [2025-02-06 12:16:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:53,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:16:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:53,867 INFO L225 Difference]: With dead ends: 2090 [2025-02-06 12:16:53,867 INFO L226 Difference]: Without dead ends: 2090 [2025-02-06 12:16:53,867 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:16:53,868 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 886 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:53,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 1688 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:16:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2025-02-06 12:16:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1515. [2025-02-06 12:16:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1166 states have (on average 1.7367066895368781) internal successors, (2025), 1506 states have internal predecessors, (2025), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2057 transitions. [2025-02-06 12:16:53,890 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2057 transitions. Word has length 9 [2025-02-06 12:16:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:53,891 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2057 transitions. [2025-02-06 12:16:53,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2057 transitions. [2025-02-06 12:16:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 12:16:53,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:53,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:16:53,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:53,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1065103286, now seen corresponding path program 1 times [2025-02-06 12:16:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436838935] [2025-02-06 12:16:53,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:53,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:16:53,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:16:53,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:53,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:53,980 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:16:53,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436838935] [2025-02-06 12:16:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436838935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189748736] [2025-02-06 12:16:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:53,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:53,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:53,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:53,981 INFO L87 Difference]: Start difference. First operand 1515 states and 2057 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:16:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:54,189 INFO L93 Difference]: Finished difference Result 2712 states and 3608 transitions. [2025-02-06 12:16:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:54,190 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:16:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:54,197 INFO L225 Difference]: With dead ends: 2712 [2025-02-06 12:16:54,197 INFO L226 Difference]: Without dead ends: 2712 [2025-02-06 12:16:54,198 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:16:54,201 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 1108 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:54,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 3212 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:16:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-02-06 12:16:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1518. [2025-02-06 12:16:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1169 states have (on average 1.7348160821214713) internal successors, (2028), 1509 states have internal predecessors, (2028), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2060 transitions. [2025-02-06 12:16:54,226 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2060 transitions. Word has length 12 [2025-02-06 12:16:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:54,226 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2060 transitions. [2025-02-06 12:16:54,226 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:16:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2060 transitions. [2025-02-06 12:16:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 12:16:54,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:54,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:54,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:16:54,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:54,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 919411356, now seen corresponding path program 1 times [2025-02-06 12:16:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:54,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080601828] [2025-02-06 12:16:54,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:54,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:16:54,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:16:54,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:16:54,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:54,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080601828] [2025-02-06 12:16:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080601828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:54,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:54,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437847278] [2025-02-06 12:16:54,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:54,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:54,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:54,307 INFO L87 Difference]: Start difference. First operand 1518 states and 2060 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:54,842 INFO L93 Difference]: Finished difference Result 1593 states and 2166 transitions. [2025-02-06 12:16:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:54,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 12:16:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:54,846 INFO L225 Difference]: With dead ends: 1593 [2025-02-06 12:16:54,846 INFO L226 Difference]: Without dead ends: 1593 [2025-02-06 12:16:54,847 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:16:54,847 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1359 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:54,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1307 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:16:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-02-06 12:16:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1495. [2025-02-06 12:16:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1169 states have (on average 1.6954662104362703) internal successors, (1982), 1486 states have internal predecessors, (1982), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2014 transitions. [2025-02-06 12:16:54,865 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2014 transitions. Word has length 19 [2025-02-06 12:16:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:54,865 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2014 transitions. [2025-02-06 12:16:54,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2014 transitions. [2025-02-06 12:16:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 12:16:54,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:54,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:16:54,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 919411357, now seen corresponding path program 1 times [2025-02-06 12:16:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535126565] [2025-02-06 12:16:54,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:54,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:16:54,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:16:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:54,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:54,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:16:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535126565] [2025-02-06 12:16:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535126565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683698019] [2025-02-06 12:16:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:54,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:54,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:54,928 INFO L87 Difference]: Start difference. First operand 1495 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:54,984 INFO L93 Difference]: Finished difference Result 1357 states and 1808 transitions. [2025-02-06 12:16:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 12:16:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:54,987 INFO L225 Difference]: With dead ends: 1357 [2025-02-06 12:16:54,987 INFO L226 Difference]: Without dead ends: 1357 [2025-02-06 12:16:54,988 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:16:54,988 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 60 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:54,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1931 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:16:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-02-06 12:16:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2025-02-06 12:16:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1043 states have (on average 1.7027804410354745) internal successors, (1776), 1348 states have internal predecessors, (1776), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1808 transitions. [2025-02-06 12:16:55,019 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1808 transitions. Word has length 19 [2025-02-06 12:16:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:55,019 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1808 transitions. [2025-02-06 12:16:55,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1808 transitions. [2025-02-06 12:16:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 12:16:55,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:55,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:16:55,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:55,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1563142830, now seen corresponding path program 1 times [2025-02-06 12:16:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736408202] [2025-02-06 12:16:55,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:55,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:16:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:16:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:55,071 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:16:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:55,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736408202] [2025-02-06 12:16:55,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736408202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:55,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63057978] [2025-02-06 12:16:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:55,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:55,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:55,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:55,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:55,073 INFO L87 Difference]: Start difference. First operand 1357 states and 1808 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:55,164 INFO L93 Difference]: Finished difference Result 1328 states and 1758 transitions. [2025-02-06 12:16:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:55,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 12:16:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:55,167 INFO L225 Difference]: With dead ends: 1328 [2025-02-06 12:16:55,167 INFO L226 Difference]: Without dead ends: 1328 [2025-02-06 12:16:55,168 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:16:55,168 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 41 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:55,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2843 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:16:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-02-06 12:16:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1322. [2025-02-06 12:16:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1015 states have (on average 1.6945812807881773) internal successors, (1720), 1313 states have internal predecessors, (1720), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1752 transitions. [2025-02-06 12:16:55,186 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1752 transitions. Word has length 20 [2025-02-06 12:16:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:55,186 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1752 transitions. [2025-02-06 12:16:55,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1752 transitions. [2025-02-06 12:16:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 12:16:55,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:55,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:55,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:16:55,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:55,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1593730200, now seen corresponding path program 1 times [2025-02-06 12:16:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347300199] [2025-02-06 12:16:55,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:55,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:16:55,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:16:55,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:55,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:55,386 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:16:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347300199] [2025-02-06 12:16:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347300199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461190178] [2025-02-06 12:16:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:55,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:55,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:55,387 INFO L87 Difference]: Start difference. First operand 1322 states and 1752 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:56,289 INFO L93 Difference]: Finished difference Result 2130 states and 2915 transitions. [2025-02-06 12:16:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:16:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 12:16:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:56,294 INFO L225 Difference]: With dead ends: 2130 [2025-02-06 12:16:56,294 INFO L226 Difference]: Without dead ends: 2130 [2025-02-06 12:16:56,294 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:16:56,298 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 835 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:56,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1863 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:16:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-02-06 12:16:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1318. [2025-02-06 12:16:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1015 states have (on average 1.6866995073891626) internal successors, (1712), 1309 states have internal predecessors, (1712), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1744 transitions. [2025-02-06 12:16:56,317 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1744 transitions. Word has length 34 [2025-02-06 12:16:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:56,317 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1744 transitions. [2025-02-06 12:16:56,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:16:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1744 transitions. [2025-02-06 12:16:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 12:16:56,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:56,321 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:16:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:16:56,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1742252603, now seen corresponding path program 1 times [2025-02-06 12:16:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662970343] [2025-02-06 12:16:56,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:56,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:56,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 12:16:56,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 12:16:56,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:56,414 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:16:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:56,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662970343] [2025-02-06 12:16:56,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662970343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:56,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:56,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572467135] [2025-02-06 12:16:56,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:56,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:16:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:56,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:16:56,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:16:56,416 INFO L87 Difference]: Start difference. First operand 1318 states and 1744 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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:16:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:56,495 INFO L93 Difference]: Finished difference Result 1318 states and 1736 transitions. [2025-02-06 12:16:56,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:16:56,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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:16:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:56,498 INFO L225 Difference]: With dead ends: 1318 [2025-02-06 12:16:56,498 INFO L226 Difference]: Without dead ends: 1318 [2025-02-06 12:16:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:16:56,499 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 21 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:56,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2825 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:16:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-06 12:16:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2025-02-06 12:16:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1015 states have (on average 1.6788177339901478) internal successors, (1704), 1309 states have internal predecessors, (1704), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 12:16:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1736 transitions. [2025-02-06 12:16:56,514 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1736 transitions. Word has length 69 [2025-02-06 12:16:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1736 transitions. [2025-02-06 12:16:56,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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:16:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1736 transitions. [2025-02-06 12:16:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:16:56,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:56,517 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:16:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:16:56,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:56,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -181286157, now seen corresponding path program 1 times [2025-02-06 12:16:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324011564] [2025-02-06 12:16:56,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:56,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 12:16:56,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:16:56,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:56,603 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:16:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324011564] [2025-02-06 12:16:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324011564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:56,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:16:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280554927] [2025-02-06 12:16:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:56,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:16:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:56,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:16:56,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:16:56,604 INFO L87 Difference]: Start difference. First operand 1318 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:16:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:56,724 INFO L93 Difference]: Finished difference Result 1848 states and 2498 transitions. [2025-02-06 12:16:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:16:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:16:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:56,730 INFO L225 Difference]: With dead ends: 1848 [2025-02-06 12:16:56,730 INFO L226 Difference]: Without dead ends: 1848 [2025-02-06 12:16:56,730 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:16:56,731 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 364 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:56,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2153 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:16:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2025-02-06 12:16:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1791. [2025-02-06 12:16:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1478 states have (on average 1.6529093369418133) internal successors, (2443), 1782 states have internal predecessors, (2443), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2495 transitions. [2025-02-06 12:16:56,751 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2495 transitions. Word has length 77 [2025-02-06 12:16:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:56,751 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2495 transitions. [2025-02-06 12:16:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:16:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2495 transitions. [2025-02-06 12:16:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:16:56,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:56,752 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:16:56,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:16:56,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:56,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 970313086, now seen corresponding path program 1 times [2025-02-06 12:16:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716831761] [2025-02-06 12:16:56,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:56,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:16:56,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:16:56,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:56,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:56,945 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:16:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716831761] [2025-02-06 12:16:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716831761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:56,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:56,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810845061] [2025-02-06 12:16:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:16:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:56,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:16:56,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:16:56,946 INFO L87 Difference]: Start difference. First operand 1791 states and 2495 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:16:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:57,515 INFO L93 Difference]: Finished difference Result 1790 states and 2493 transitions. [2025-02-06 12:16:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:16:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2025-02-06 12:16:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:57,519 INFO L225 Difference]: With dead ends: 1790 [2025-02-06 12:16:57,519 INFO L226 Difference]: Without dead ends: 1790 [2025-02-06 12:16:57,519 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:16:57,519 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 2 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:57,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2857 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:16:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2025-02-06 12:16:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1790. [2025-02-06 12:16:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1478 states have (on average 1.6515561569688768) internal successors, (2441), 1781 states have internal predecessors, (2441), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2493 transitions. [2025-02-06 12:16:57,536 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2493 transitions. Word has length 85 [2025-02-06 12:16:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:57,536 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2493 transitions. [2025-02-06 12:16:57,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:16:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2493 transitions. [2025-02-06 12:16:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 12:16:57,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:57,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:57,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:16:57,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash 970313087, now seen corresponding path program 1 times [2025-02-06 12:16:57,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987092513] [2025-02-06 12:16:57,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:57,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 12:16:57,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 12:16:57,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:57,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:57,857 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:16:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987092513] [2025-02-06 12:16:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987092513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:16:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347198285] [2025-02-06 12:16:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:57,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:16:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:57,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:16:57,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:16:57,859 INFO L87 Difference]: Start difference. First operand 1790 states and 2493 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:16:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:58,504 INFO L93 Difference]: Finished difference Result 1789 states and 2491 transitions. [2025-02-06 12:16:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:16:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2025-02-06 12:16:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:58,512 INFO L225 Difference]: With dead ends: 1789 [2025-02-06 12:16:58,513 INFO L226 Difference]: Without dead ends: 1789 [2025-02-06 12:16:58,513 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:16:58,513 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 1 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:58,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2795 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:16:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2025-02-06 12:16:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2025-02-06 12:16:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1476 states have (on average 1.6524390243902438) internal successors, (2439), 1780 states have internal predecessors, (2439), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:16:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2491 transitions. [2025-02-06 12:16:58,550 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2491 transitions. Word has length 85 [2025-02-06 12:16:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:58,553 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2491 transitions. [2025-02-06 12:16:58,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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:16:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2491 transitions. [2025-02-06 12:16:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 12:16:58,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:58,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:16:58,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:16:58,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash -806149893, now seen corresponding path program 1 times [2025-02-06 12:16:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324152183] [2025-02-06 12:16:58,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:58,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:58,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 12:16:58,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 12:16:58,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:58,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:58,739 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:16:58,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324152183] [2025-02-06 12:16:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324152183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:58,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:16:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730125528] [2025-02-06 12:16:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:16:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:58,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:16:58,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:16:58,742 INFO L87 Difference]: Start difference. First operand 1789 states and 2491 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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:16:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:16:59,512 INFO L93 Difference]: Finished difference Result 1807 states and 2517 transitions. [2025-02-06 12:16:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:16:59,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2025-02-06 12:16:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:16:59,516 INFO L225 Difference]: With dead ends: 1807 [2025-02-06 12:16:59,516 INFO L226 Difference]: Without dead ends: 1807 [2025-02-06 12:16:59,517 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:16:59,517 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 13 mSDsluCounter, 3474 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:16:59,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4421 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:16:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-02-06 12:16:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1798. [2025-02-06 12:16:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1484 states have (on average 1.650943396226415) internal successors, (2450), 1787 states have internal predecessors, (2450), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2025-02-06 12:16:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2507 transitions. [2025-02-06 12:16:59,544 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2507 transitions. Word has length 93 [2025-02-06 12:16:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:16:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2507 transitions. [2025-02-06 12:16:59,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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:16:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2507 transitions. [2025-02-06 12:16:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 12:16:59,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:16:59,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:59,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:16:59,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:16:59,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:16:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash -806149892, now seen corresponding path program 1 times [2025-02-06 12:16:59,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:16:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374170652] [2025-02-06 12:16:59,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:16:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:16:59,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 12:16:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 12:16:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:16:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:16:59,905 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:16:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:16:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374170652] [2025-02-06 12:16:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374170652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:16:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:16:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:16:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584406103] [2025-02-06 12:16:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:16:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:16:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:16:59,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:16:59,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:16:59,906 INFO L87 Difference]: Start difference. First operand 1798 states and 2507 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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:17:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:00,647 INFO L93 Difference]: Finished difference Result 1798 states and 2505 transitions. [2025-02-06 12:17:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:17:00,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2025-02-06 12:17:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:00,651 INFO L225 Difference]: With dead ends: 1798 [2025-02-06 12:17:00,651 INFO L226 Difference]: Without dead ends: 1798 [2025-02-06 12:17:00,651 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:17:00,652 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 8 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:00,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3572 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:17:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-02-06 12:17:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1798. [2025-02-06 12:17:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1484 states have (on average 1.6495956873315365) internal successors, (2448), 1787 states have internal predecessors, (2448), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2025-02-06 12:17:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2505 transitions. [2025-02-06 12:17:00,669 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2505 transitions. Word has length 93 [2025-02-06 12:17:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:00,669 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2505 transitions. [2025-02-06 12:17:00,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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:17:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2505 transitions. [2025-02-06 12:17:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:17:00,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:00,670 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:17:00,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:17:00,670 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:00,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1447299192, now seen corresponding path program 1 times [2025-02-06 12:17:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581303057] [2025-02-06 12:17:00,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:00,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:17:00,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:17:00,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:00,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:01,018 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:17:01,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:01,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581303057] [2025-02-06 12:17:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581303057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:01,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214370992] [2025-02-06 12:17:01,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:01,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:01,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:01,022 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:17:01,023 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:17:01,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:17:01,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:17:01,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:01,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:01,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:17:01,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:01,209 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:17:01,338 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:01,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:17:01,371 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:17:01,438 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:17:01,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:01,594 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:17:01,639 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:17:01,665 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:17:01,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214370992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:01,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:01,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-02-06 12:17:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86287268] [2025-02-06 12:17:01,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:01,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:17:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:01,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:17:01,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=322, Unknown=2, NotChecked=0, Total=380 [2025-02-06 12:17:01,722 INFO L87 Difference]: Start difference. First operand 1798 states and 2505 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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:17:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:04,205 INFO L93 Difference]: Finished difference Result 1805 states and 2511 transitions. [2025-02-06 12:17:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:17:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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 94 [2025-02-06 12:17:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:04,209 INFO L225 Difference]: With dead ends: 1805 [2025-02-06 12:17:04,209 INFO L226 Difference]: Without dead ends: 1805 [2025-02-06 12:17:04,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=467, Unknown=2, NotChecked=0, Total=552 [2025-02-06 12:17:04,210 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 895 mSDsluCounter, 7694 mSDsCounter, 0 mSdLazyCounter, 5650 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 8309 SdHoareTripleChecker+Invalid, 5669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:04,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 8309 Invalid, 5669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5650 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:17:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-02-06 12:17:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1802. [2025-02-06 12:17:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1488 states have (on average 1.6471774193548387) internal successors, (2451), 1790 states have internal predecessors, (2451), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2505 transitions. [2025-02-06 12:17:04,227 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2505 transitions. Word has length 94 [2025-02-06 12:17:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:04,227 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2505 transitions. [2025-02-06 12:17:04,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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:17:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2505 transitions. [2025-02-06 12:17:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 12:17:04,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:04,228 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:17:04,235 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:17:04,432 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,SelfDestructingSolverStorable15 [2025-02-06 12:17:04,435 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1447299191, now seen corresponding path program 1 times [2025-02-06 12:17:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:04,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468014472] [2025-02-06 12:17:04,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:04,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:17:04,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:17:04,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:04,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:04,941 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:17:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468014472] [2025-02-06 12:17:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468014472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104735861] [2025-02-06 12:17:04,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:04,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:04,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:04,949 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:17:04,953 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:17:05,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 12:17:05,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 12:17:05,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:05,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:05,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 12:17:05,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:05,112 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:17:05,186 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:17:05,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:17:05,192 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:17:05,213 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:17:05,216 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:17:05,272 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:17:05,275 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:17:05,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:05,346 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:17:05,352 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:17:05,376 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:17:05,378 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:17:05,392 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:17:05,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:05,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_730 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:17:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104735861] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:05,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-02-06 12:17:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025729848] [2025-02-06 12:17:05,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:17:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:17:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-06 12:17:05,460 INFO L87 Difference]: Start difference. First operand 1802 states and 2505 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 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:17:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:08,130 INFO L93 Difference]: Finished difference Result 1804 states and 2509 transitions. [2025-02-06 12:17:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:17:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 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 94 [2025-02-06 12:17:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:08,134 INFO L225 Difference]: With dead ends: 1804 [2025-02-06 12:17:08,134 INFO L226 Difference]: Without dead ends: 1804 [2025-02-06 12:17:08,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-02-06 12:17:08,134 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 892 mSDsluCounter, 5506 mSDsCounter, 0 mSdLazyCounter, 5820 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 6124 SdHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:08,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 6124 Invalid, 5843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5820 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 12:17:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-02-06 12:17:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1792. [2025-02-06 12:17:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1480 states have (on average 1.6486486486486487) internal successors, (2440), 1782 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:17:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2492 transitions. [2025-02-06 12:17:08,153 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2492 transitions. Word has length 94 [2025-02-06 12:17:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:08,153 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2492 transitions. [2025-02-06 12:17:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 18 states have internal predecessors, (147), 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:17:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2492 transitions. [2025-02-06 12:17:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:17:08,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:08,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:08,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:17:08,356 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,SelfDestructingSolverStorable16 [2025-02-06 12:17:08,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1446564372, now seen corresponding path program 1 times [2025-02-06 12:17:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190235858] [2025-02-06 12:17:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:08,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:17:08,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:17:08,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:08,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:08,703 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:17:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190235858] [2025-02-06 12:17:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190235858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:08,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:08,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 12:17:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421858084] [2025-02-06 12:17:08,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:08,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:17:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:08,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:17:08,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:17:08,705 INFO L87 Difference]: Start difference. First operand 1792 states and 2492 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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:17:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:09,972 INFO L93 Difference]: Finished difference Result 1811 states and 2517 transitions. [2025-02-06 12:17:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:17:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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 96 [2025-02-06 12:17:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:09,975 INFO L225 Difference]: With dead ends: 1811 [2025-02-06 12:17:09,975 INFO L226 Difference]: Without dead ends: 1811 [2025-02-06 12:17:09,975 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:17:09,975 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 922 mSDsluCounter, 4175 mSDsCounter, 0 mSdLazyCounter, 3215 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 4790 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:09,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 4790 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 12:17:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-02-06 12:17:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1807. [2025-02-06 12:17:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1494 states have (on average 1.644578313253012) internal successors, (2457), 1795 states have internal predecessors, (2457), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2511 transitions. [2025-02-06 12:17:09,989 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2511 transitions. Word has length 96 [2025-02-06 12:17:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:09,989 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2511 transitions. [2025-02-06 12:17:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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:17:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2511 transitions. [2025-02-06 12:17:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 12:17:09,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:09,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:09,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:17:09,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:09,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1446564373, now seen corresponding path program 1 times [2025-02-06 12:17:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387439399] [2025-02-06 12:17:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:10,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 12:17:10,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 12:17:10,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:10,439 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:17:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:10,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387439399] [2025-02-06 12:17:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387439399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:17:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224373962] [2025-02-06 12:17:10,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:17:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:10,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:17:10,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:17:10,440 INFO L87 Difference]: Start difference. First operand 1807 states and 2511 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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:17:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:11,891 INFO L93 Difference]: Finished difference Result 1810 states and 2515 transitions. [2025-02-06 12:17:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:17:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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 96 [2025-02-06 12:17:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:11,894 INFO L225 Difference]: With dead ends: 1810 [2025-02-06 12:17:11,894 INFO L226 Difference]: Without dead ends: 1810 [2025-02-06 12:17:11,894 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:17:11,895 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 918 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 3336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:11,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 3672 Invalid, 3336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:17:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-02-06 12:17:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1807. [2025-02-06 12:17:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1494 states have (on average 1.643239625167336) internal successors, (2455), 1795 states have internal predecessors, (2455), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2509 transitions. [2025-02-06 12:17:11,907 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2509 transitions. Word has length 96 [2025-02-06 12:17:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:11,907 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2509 transitions. [2025-02-06 12:17:11,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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:17:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2509 transitions. [2025-02-06 12:17:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:17:11,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:11,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:11,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:17:11,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:11,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash 687363175, now seen corresponding path program 1 times [2025-02-06 12:17:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977692528] [2025-02-06 12:17:11,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:11,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:17:11,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:17:11,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:11,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:12,218 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:17:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977692528] [2025-02-06 12:17:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977692528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339722044] [2025-02-06 12:17:12,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:12,225 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:17:12,226 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:17:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:17:12,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:17:12,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:12,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:12,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:17:12,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:12,402 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:17:12,499 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:12,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:17:12,521 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:17:12,578 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:17:12,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:12,704 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:17:12,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:12,767 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:17:12,780 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:17:12,802 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:17:12,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:12,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (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_1014))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1011)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339722044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:12,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-02-06 12:17:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749570950] [2025-02-06 12:17:12,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:12,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:17:12,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:12,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:17:12,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=457, Unknown=17, NotChecked=44, Total=600 [2025-02-06 12:17:12,880 INFO L87 Difference]: Start difference. First operand 1807 states and 2509 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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:17:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:14,332 INFO L93 Difference]: Finished difference Result 1809 states and 2513 transitions. [2025-02-06 12:17:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:17:14,333 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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 97 [2025-02-06 12:17:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:14,337 INFO L225 Difference]: With dead ends: 1809 [2025-02-06 12:17:14,337 INFO L226 Difference]: Without dead ends: 1809 [2025-02-06 12:17:14,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=585, Unknown=17, NotChecked=50, Total=756 [2025-02-06 12:17:14,338 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 890 mSDsluCounter, 5315 mSDsCounter, 0 mSdLazyCounter, 3974 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:14,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 5929 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3974 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 12:17:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-02-06 12:17:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1806. [2025-02-06 12:17:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1494 states have (on average 1.64190093708166) internal successors, (2453), 1794 states have internal predecessors, (2453), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2507 transitions. [2025-02-06 12:17:14,369 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2507 transitions. Word has length 97 [2025-02-06 12:17:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:14,369 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2507 transitions. [2025-02-06 12:17:14,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 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:17:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2507 transitions. [2025-02-06 12:17:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 12:17:14,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:14,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:14,388 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:17:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:14,572 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:14,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 687363176, now seen corresponding path program 1 times [2025-02-06 12:17:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789563605] [2025-02-06 12:17:14,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:14,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:17:14,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:17:14,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:14,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:15,237 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:17:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789563605] [2025-02-06 12:17:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789563605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109899652] [2025-02-06 12:17:15,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:15,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:15,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:15,241 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:17:15,243 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:17:15,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 12:17:15,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 12:17:15,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:15,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:15,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 12:17:15,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:15,421 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:17:15,619 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:17:15,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:17:15,637 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:17:15,691 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:17:15,704 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:17:15,752 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:17:15,755 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:17:15,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:15,820 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:17:15,824 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:17:15,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:15,880 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:17:15,884 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:17:15,893 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:17:15,895 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:17:15,910 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:17:15,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:16,020 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_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1165 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-02-06 12:17:16,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1171))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1172) .cse1 v_ArrVal_1165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:17:16,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109899652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:16,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:16,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-06 12:17:16,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637091767] [2025-02-06 12:17:16,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:17:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:16,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:17:16,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=432, Unknown=7, NotChecked=86, Total=600 [2025-02-06 12:17:16,059 INFO L87 Difference]: Start difference. First operand 1806 states and 2507 transitions. Second operand has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 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:17:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:18,427 INFO L93 Difference]: Finished difference Result 1808 states and 2511 transitions. [2025-02-06 12:17:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:17:18,427 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 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 97 [2025-02-06 12:17:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:18,430 INFO L225 Difference]: With dead ends: 1808 [2025-02-06 12:17:18,430 INFO L226 Difference]: Without dead ends: 1808 [2025-02-06 12:17:18,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=638, Unknown=7, NotChecked=106, Total=870 [2025-02-06 12:17:18,431 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 893 mSDsluCounter, 5938 mSDsCounter, 0 mSdLazyCounter, 6371 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 6555 SdHoareTripleChecker+Invalid, 6403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 6371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:18,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 6555 Invalid, 6403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 6371 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 12:17:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2025-02-06 12:17:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1790. [2025-02-06 12:17:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1480 states have (on average 1.645945945945946) internal successors, (2436), 1780 states have internal predecessors, (2436), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:17:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2488 transitions. [2025-02-06 12:17:18,446 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2488 transitions. Word has length 97 [2025-02-06 12:17:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2488 transitions. [2025-02-06 12:17:18,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 20 states have internal predecessors, (153), 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:17:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2488 transitions. [2025-02-06 12:17:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:17:18,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:18,447 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:17:18,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:17:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 12:17:18,650 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1101741260, now seen corresponding path program 1 times [2025-02-06 12:17:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712439107] [2025-02-06 12:17:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:18,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:17:18,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:17:18,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:18,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:19,029 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:17:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:19,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712439107] [2025-02-06 12:17:19,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712439107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:19,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:19,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:17:19,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892333470] [2025-02-06 12:17:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:19,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:17:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:19,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:17:19,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:17:19,031 INFO L87 Difference]: Start difference. First operand 1790 states and 2488 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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:17:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:20,626 INFO L93 Difference]: Finished difference Result 1815 states and 2519 transitions. [2025-02-06 12:17:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:17:20,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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 99 [2025-02-06 12:17:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:20,632 INFO L225 Difference]: With dead ends: 1815 [2025-02-06 12:17:20,632 INFO L226 Difference]: Without dead ends: 1815 [2025-02-06 12:17:20,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:17:20,634 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 904 mSDsluCounter, 5338 mSDsCounter, 0 mSdLazyCounter, 4037 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 5952 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:20,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 5952 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4037 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:17:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-02-06 12:17:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1811. [2025-02-06 12:17:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1500 states have (on average 1.6393333333333333) internal successors, (2459), 1799 states have internal predecessors, (2459), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2513 transitions. [2025-02-06 12:17:20,648 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2513 transitions. Word has length 99 [2025-02-06 12:17:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:20,649 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2513 transitions. [2025-02-06 12:17:20,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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:17:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2513 transitions. [2025-02-06 12:17:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 12:17:20,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:20,649 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:17:20,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:17:20,650 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:20,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1101741259, now seen corresponding path program 1 times [2025-02-06 12:17:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:20,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579133487] [2025-02-06 12:17:20,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:20,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 12:17:20,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 12:17:20,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:21,036 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:17:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579133487] [2025-02-06 12:17:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579133487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:21,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:21,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 12:17:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497169675] [2025-02-06 12:17:21,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:21,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 12:17:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:21,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 12:17:21,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 12:17:21,038 INFO L87 Difference]: Start difference. First operand 1811 states and 2513 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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:17:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:22,604 INFO L93 Difference]: Finished difference Result 1814 states and 2517 transitions. [2025-02-06 12:17:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:17:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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 99 [2025-02-06 12:17:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:22,607 INFO L225 Difference]: With dead ends: 1814 [2025-02-06 12:17:22,607 INFO L226 Difference]: Without dead ends: 1814 [2025-02-06 12:17:22,607 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:17:22,608 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 919 mSDsluCounter, 3518 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 3857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:22,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 4136 Invalid, 3857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:17:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2025-02-06 12:17:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1811. [2025-02-06 12:17:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1500 states have (on average 1.638) internal successors, (2457), 1799 states have internal predecessors, (2457), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2511 transitions. [2025-02-06 12:17:22,625 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2511 transitions. Word has length 99 [2025-02-06 12:17:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:22,625 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2511 transitions. [2025-02-06 12:17:22,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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:17:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2511 transitions. [2025-02-06 12:17:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 12:17:22,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:22,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 12:17:22,626 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:22,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1166820351, now seen corresponding path program 1 times [2025-02-06 12:17:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925826348] [2025-02-06 12:17:22,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:22,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:17:22,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:17:22,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:22,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:22,994 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:17:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925826348] [2025-02-06 12:17:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925826348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148542265] [2025-02-06 12:17:22,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:22,996 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:17:23,001 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:17:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:17:23,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:17:23,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:23,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:23,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 12:17:23,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:23,186 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:17:23,272 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:17:23,289 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:17:23,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 12:17:23,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:23,430 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:17:23,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:23,485 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:17:23,525 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:23,525 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:17:23,534 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:17:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:17:23,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:23,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1478) |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:17:23,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (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_1478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:17:23,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1481 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1481))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1477)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1478)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148542265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:23,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:23,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-06 12:17:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083822739] [2025-02-06 12:17:23,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:23,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:17:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:23,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:17:23,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=536, Unknown=25, NotChecked=150, Total=812 [2025-02-06 12:17:23,655 INFO L87 Difference]: Start difference. First operand 1811 states and 2511 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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:17:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:25,580 INFO L93 Difference]: Finished difference Result 1813 states and 2515 transitions. [2025-02-06 12:17:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:17:25,581 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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 100 [2025-02-06 12:17:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:25,583 INFO L225 Difference]: With dead ends: 1813 [2025-02-06 12:17:25,583 INFO L226 Difference]: Without dead ends: 1813 [2025-02-06 12:17:25,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=676, Unknown=25, NotChecked=168, Total=992 [2025-02-06 12:17:25,584 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 881 mSDsluCounter, 5908 mSDsCounter, 0 mSdLazyCounter, 4392 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 6521 SdHoareTripleChecker+Invalid, 4411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:25,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 6521 Invalid, 4411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4392 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 12:17:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-02-06 12:17:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1810. [2025-02-06 12:17:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1500 states have (on average 1.6366666666666667) internal successors, (2455), 1798 states have internal predecessors, (2455), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2509 transitions. [2025-02-06 12:17:25,595 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2509 transitions. Word has length 100 [2025-02-06 12:17:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:25,596 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2509 transitions. [2025-02-06 12:17:25,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 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:17:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2509 transitions. [2025-02-06 12:17:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 12:17:25,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:25,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:25,603 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:17:25,800 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,SelfDestructingSolverStorable23 [2025-02-06 12:17:25,801 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1166820350, now seen corresponding path program 1 times [2025-02-06 12:17:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511712169] [2025-02-06 12:17:25,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:25,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:17:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:17:25,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:25,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:26,408 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:17:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511712169] [2025-02-06 12:17:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511712169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672105130] [2025-02-06 12:17:26,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:26,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:26,412 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:17:26,413 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:17:26,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 12:17:26,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 12:17:26,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:26,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:26,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 12:17:26,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:26,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:17:26,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:17:26,677 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:17:26,681 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:17:26,699 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:17:26,700 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:17:26,752 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:17:26,754 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:17:26,815 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:26,815 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:17:26,819 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:17:26,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:26,869 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:17:26,873 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:17:26,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:26,910 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:17:26,915 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:17:26,924 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:17:26,926 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:17:26,941 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:17:26,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:26,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1646) |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~mem57#1.base| v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1646 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:17:27,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1645) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1644))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1645) .cse1 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:17:27,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1644))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1645) .cse1 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1645) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2025-02-06 12:17:27,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1647 (Array Int Int)) (v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1652))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1644))) (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~mem54#1.base| v_ArrVal_1653) .cse0 v_ArrVal_1645) .cse1 v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1644 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1652 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1652))) (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~mem54#1.base| v_ArrVal_1653) .cse5 v_ArrVal_1645) (select (select (store .cse6 .cse5 v_ArrVal_1644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1646))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2025-02-06 12:17:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672105130] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:27,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2025-02-06 12:17:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264836186] [2025-02-06 12:17:27,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:27,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:17:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:27,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:17:27,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=507, Unknown=15, NotChecked=196, Total=812 [2025-02-06 12:17:27,092 INFO L87 Difference]: Start difference. First operand 1810 states and 2509 transitions. Second operand has 22 states, 19 states have (on average 8.368421052631579) internal successors, (159), 22 states have internal predecessors, (159), 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:17:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:30,078 INFO L93 Difference]: Finished difference Result 1812 states and 2513 transitions. [2025-02-06 12:17:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:17:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.368421052631579) internal successors, (159), 22 states have internal predecessors, (159), 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 100 [2025-02-06 12:17:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:30,085 INFO L225 Difference]: With dead ends: 1812 [2025-02-06 12:17:30,085 INFO L226 Difference]: Without dead ends: 1812 [2025-02-06 12:17:30,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=779, Unknown=15, NotChecked=244, Total=1190 [2025-02-06 12:17:30,086 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 886 mSDsluCounter, 6987 mSDsCounter, 0 mSdLazyCounter, 7200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 7603 SdHoareTripleChecker+Invalid, 7222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:30,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 7603 Invalid, 7222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7200 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-06 12:17:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-02-06 12:17:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1788. [2025-02-06 12:17:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1480 states have (on average 1.6432432432432433) internal successors, (2432), 1778 states have internal predecessors, (2432), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:17:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2484 transitions. [2025-02-06 12:17:30,097 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2484 transitions. Word has length 100 [2025-02-06 12:17:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:30,097 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 2484 transitions. [2025-02-06 12:17:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.368421052631579) internal successors, (159), 22 states have internal predecessors, (159), 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:17:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2484 transitions. [2025-02-06 12:17:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 12:17:30,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:30,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:30,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:17:30,302 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,SelfDestructingSolverStorable24 [2025-02-06 12:17:30,302 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 167092973, now seen corresponding path program 1 times [2025-02-06 12:17:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324228911] [2025-02-06 12:17:30,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:30,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 12:17:30,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 12:17:30,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:30,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:30,724 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:17:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324228911] [2025-02-06 12:17:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324228911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:30,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:17:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22536309] [2025-02-06 12:17:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:30,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:17:30,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:30,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:17:30,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:17:30,726 INFO L87 Difference]: Start difference. First operand 1788 states and 2484 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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:17:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:32,154 INFO L93 Difference]: Finished difference Result 1819 states and 2521 transitions. [2025-02-06 12:17:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:17:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2025-02-06 12:17:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:32,157 INFO L225 Difference]: With dead ends: 1819 [2025-02-06 12:17:32,157 INFO L226 Difference]: Without dead ends: 1819 [2025-02-06 12:17:32,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:17:32,158 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 910 mSDsluCounter, 5935 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 6551 SdHoareTripleChecker+Invalid, 4373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:32,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 6551 Invalid, 4373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:17:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-02-06 12:17:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1815. [2025-02-06 12:17:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1506 states have (on average 1.6341301460823374) internal successors, (2461), 1803 states have internal predecessors, (2461), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2515 transitions. [2025-02-06 12:17:32,182 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2515 transitions. Word has length 102 [2025-02-06 12:17:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:32,183 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2515 transitions. [2025-02-06 12:17:32,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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:17:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2515 transitions. [2025-02-06 12:17:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 12:17:32,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:32,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:32,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 12:17:32,183 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:32,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash 167092974, now seen corresponding path program 1 times [2025-02-06 12:17:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496879145] [2025-02-06 12:17:32,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:32,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 12:17:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 12:17:32,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:32,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:32,864 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:17:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496879145] [2025-02-06 12:17:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496879145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:32,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:32,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:17:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849483280] [2025-02-06 12:17:32,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:32,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:17:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:32,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:17:32,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:17:32,865 INFO L87 Difference]: Start difference. First operand 1815 states and 2515 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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:17:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:34,308 INFO L93 Difference]: Finished difference Result 1818 states and 2519 transitions. [2025-02-06 12:17:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:17:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2025-02-06 12:17:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:34,311 INFO L225 Difference]: With dead ends: 1818 [2025-02-06 12:17:34,314 INFO L226 Difference]: Without dead ends: 1818 [2025-02-06 12:17:34,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:17:34,315 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 919 mSDsluCounter, 3622 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 4239 SdHoareTripleChecker+Invalid, 3691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:34,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 4239 Invalid, 3691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 12:17:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2025-02-06 12:17:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1815. [2025-02-06 12:17:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1506 states have (on average 1.6328021248339974) internal successors, (2459), 1803 states have internal predecessors, (2459), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2513 transitions. [2025-02-06 12:17:34,338 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2513 transitions. Word has length 102 [2025-02-06 12:17:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:34,338 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2513 transitions. [2025-02-06 12:17:34,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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:17:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2513 transitions. [2025-02-06 12:17:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 12:17:34,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:34,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:34,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 12:17:34,343 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:34,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1573856512, now seen corresponding path program 1 times [2025-02-06 12:17:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143778208] [2025-02-06 12:17:34,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:34,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:17:34,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:17:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:34,916 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:17:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143778208] [2025-02-06 12:17:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143778208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595904852] [2025-02-06 12:17:34,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:34,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:34,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:34,918 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:17:34,919 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:17:35,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:17:35,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:17:35,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:35,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:35,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 12:17:35,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:35,120 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:17:35,187 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:35,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:17:35,239 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:17:35,314 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:17:35,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:35,402 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:17:35,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:35,464 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:17:35,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:35,505 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:17:35,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:35,547 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:17:35,555 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:17:35,579 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:17:35,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:35,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_1984) |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:17:35,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (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_1984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:17:35,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1983))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:35,627 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:35,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (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_1982))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:35,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1987))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1982)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1983)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1984)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:35,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595904852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:35,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:35,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-02-06 12:17:35,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032749390] [2025-02-06 12:17:35,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:35,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 12:17:35,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:35,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 12:17:35,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=595, Unknown=13, NotChecked=330, Total=1056 [2025-02-06 12:17:35,651 INFO L87 Difference]: Start difference. First operand 1815 states and 2513 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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:17:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:37,652 INFO L93 Difference]: Finished difference Result 1817 states and 2517 transitions. [2025-02-06 12:17:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:17:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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 103 [2025-02-06 12:17:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:37,654 INFO L225 Difference]: With dead ends: 1817 [2025-02-06 12:17:37,654 INFO L226 Difference]: Without dead ends: 1817 [2025-02-06 12:17:37,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=741, Unknown=13, NotChecked=366, Total=1260 [2025-02-06 12:17:37,655 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 878 mSDsluCounter, 6479 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 7091 SdHoareTripleChecker+Invalid, 4809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:37,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 7091 Invalid, 4809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4788 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:17:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-02-06 12:17:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1814. [2025-02-06 12:17:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1506 states have (on average 1.6314741035856575) internal successors, (2457), 1802 states have internal predecessors, (2457), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2511 transitions. [2025-02-06 12:17:37,669 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2511 transitions. Word has length 103 [2025-02-06 12:17:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:37,669 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2511 transitions. [2025-02-06 12:17:37,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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:17:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2511 transitions. [2025-02-06 12:17:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 12:17:37,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:37,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:37,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:17:37,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:37,874 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1573856511, now seen corresponding path program 1 times [2025-02-06 12:17:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:37,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308706710] [2025-02-06 12:17:37,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:37,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:17:37,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:17:37,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:37,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:38,409 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:17:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308706710] [2025-02-06 12:17:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308706710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059995076] [2025-02-06 12:17:38,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:38,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:38,412 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:17:38,413 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:17:38,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 12:17:38,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 12:17:38,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:38,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 12:17:38,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:38,611 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:17:38,674 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:17:38,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:17:38,679 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:17:38,713 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:17:38,717 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:17:38,769 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:17:38,771 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:17:38,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:38,834 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:17:38,836 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:17:38,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:38,889 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:17:38,893 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:17:38,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:38,931 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:17:38,936 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:17:38,974 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:38,974 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:17:38,978 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:17:38,987 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:17:38,989 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:17:39,005 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:17:39,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:39,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2167 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-02-06 12:17:39,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2164) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2165))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2164) .cse1 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:17:39,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2164) .cse1 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2164) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2025-02-06 12:17:39,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2162))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2163) .cse0 v_ArrVal_2164) (select (select (store .cse1 .cse0 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2162))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2165))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2163) .cse3 v_ArrVal_2164) .cse4 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-06 12:17:39,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2164) .cse2 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2162))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2163) .cse6 v_ArrVal_2164) (select (select (store .cse7 .cse6 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-02-06 12:17:39,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2166 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2172))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2173) .cse0 v_ArrVal_2163) .cse1 v_ArrVal_2164) .cse2 v_ArrVal_2167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2165 (Array Int Int)) (v_ArrVal_2164 (Array Int Int)) (v_ArrVal_2163 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2172))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2162))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2173) .cse7 v_ArrVal_2163) .cse8 v_ArrVal_2164) (select (select (store .cse9 .cse8 v_ArrVal_2165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-02-06 12:17:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059995076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:39,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:39,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-02-06 12:17:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135116061] [2025-02-06 12:17:39,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:39,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:17:39,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:39,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:17:39,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=601, Unknown=15, NotChecked=330, Total=1056 [2025-02-06 12:17:39,190 INFO L87 Difference]: Start difference. First operand 1814 states and 2511 transitions. Second operand has 24 states, 21 states have (on average 7.857142857142857) internal successors, (165), 24 states have internal predecessors, (165), 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:17:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:42,874 INFO L93 Difference]: Finished difference Result 1816 states and 2515 transitions. [2025-02-06 12:17:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:17:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.857142857142857) internal successors, (165), 24 states have internal predecessors, (165), 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 103 [2025-02-06 12:17:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:42,876 INFO L225 Difference]: With dead ends: 1816 [2025-02-06 12:17:42,876 INFO L226 Difference]: Without dead ends: 1816 [2025-02-06 12:17:42,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=952, Unknown=15, NotChecked=414, Total=1560 [2025-02-06 12:17:42,877 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 885 mSDsluCounter, 7368 mSDsCounter, 0 mSdLazyCounter, 7876 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 7983 SdHoareTripleChecker+Invalid, 7898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:42,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 7983 Invalid, 7898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7876 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-06 12:17:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-02-06 12:17:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1786. [2025-02-06 12:17:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1480 states have (on average 1.6405405405405404) internal successors, (2428), 1776 states have internal predecessors, (2428), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:17:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2480 transitions. [2025-02-06 12:17:42,889 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2480 transitions. Word has length 103 [2025-02-06 12:17:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2480 transitions. [2025-02-06 12:17:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.857142857142857) internal successors, (165), 24 states have internal predecessors, (165), 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:17:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2480 transitions. [2025-02-06 12:17:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 12:17:42,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:42,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:42,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:17:43,095 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,SelfDestructingSolverStorable28 [2025-02-06 12:17:43,095 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:43,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash 17027047, now seen corresponding path program 1 times [2025-02-06 12:17:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186489687] [2025-02-06 12:17:43,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:43,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 12:17:43,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 12:17:43,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:43,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:43,569 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:17:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186489687] [2025-02-06 12:17:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186489687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 12:17:43,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464957463] [2025-02-06 12:17:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:43,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 12:17:43,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:43,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 12:17:43,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:17:43,571 INFO L87 Difference]: Start difference. First operand 1786 states and 2480 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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:17:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:45,290 INFO L93 Difference]: Finished difference Result 1825 states and 2525 transitions. [2025-02-06 12:17:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:17:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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 106 [2025-02-06 12:17:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:45,295 INFO L225 Difference]: With dead ends: 1825 [2025-02-06 12:17:45,295 INFO L226 Difference]: Without dead ends: 1825 [2025-02-06 12:17:45,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-06 12:17:45,296 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 923 mSDsluCounter, 5924 mSDsCounter, 0 mSdLazyCounter, 4423 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 6536 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:45,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 6536 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4423 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 12:17:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-02-06 12:17:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1821. [2025-02-06 12:17:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1514 states have (on average 1.6281373844121532) internal successors, (2465), 1809 states have internal predecessors, (2465), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2519 transitions. [2025-02-06 12:17:45,308 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2519 transitions. Word has length 106 [2025-02-06 12:17:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:45,308 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2519 transitions. [2025-02-06 12:17:45,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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:17:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2519 transitions. [2025-02-06 12:17:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 12:17:45,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:45,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:45,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:17:45,309 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:45,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 17027048, now seen corresponding path program 1 times [2025-02-06 12:17:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:45,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640605958] [2025-02-06 12:17:45,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:45,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 12:17:45,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 12:17:45,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:45,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:45,971 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:17:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640605958] [2025-02-06 12:17:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640605958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:17:45,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:17:45,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 12:17:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893458911] [2025-02-06 12:17:45,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:17:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 12:17:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:45,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 12:17:45,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 12:17:45,972 INFO L87 Difference]: Start difference. First operand 1821 states and 2519 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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:17:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:48,446 INFO L93 Difference]: Finished difference Result 1824 states and 2523 transitions. [2025-02-06 12:17:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:17:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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 106 [2025-02-06 12:17:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:48,448 INFO L225 Difference]: With dead ends: 1824 [2025-02-06 12:17:48,448 INFO L226 Difference]: Without dead ends: 1824 [2025-02-06 12:17:48,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:17:48,449 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 924 mSDsluCounter, 6025 mSDsCounter, 0 mSdLazyCounter, 6218 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 6638 SdHoareTripleChecker+Invalid, 6241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:48,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 6638 Invalid, 6241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6218 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 12:17:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2025-02-06 12:17:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1821. [2025-02-06 12:17:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1514 states have (on average 1.6268163804491413) internal successors, (2463), 1809 states have internal predecessors, (2463), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2517 transitions. [2025-02-06 12:17:48,460 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2517 transitions. Word has length 106 [2025-02-06 12:17:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:48,460 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2517 transitions. [2025-02-06 12:17:48,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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:17:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2517 transitions. [2025-02-06 12:17:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:17:48,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:48,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 12:17:48,461 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:48,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash 435078778, now seen corresponding path program 1 times [2025-02-06 12:17:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895437050] [2025-02-06 12:17:48,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:48,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:17:48,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:17:48,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:48,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:48,927 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:17:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895437050] [2025-02-06 12:17:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895437050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133302189] [2025-02-06 12:17:48,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:48,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:48,930 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:17:48,931 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:17:49,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:17:49,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:17:49,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:49,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:49,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 12:17:49,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:49,164 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:17:49,302 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:49,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:17:49,323 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:17:49,398 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:17:49,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:49,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:17:49,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:49,541 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:17:49,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:49,589 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:17:49,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:49,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 12:17:49,662 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:49,662 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:17:49,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 12:17:49,707 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-02-06 12:17:49,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-02-06 12:17:49,728 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:17:49,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:49,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (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_2537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:17:49,783 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (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~mem58#1.base| v_ArrVal_2536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:49,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (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~mem57#1.base| v_ArrVal_2535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:49,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (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_2535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:49,840 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2534))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2535)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:49,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2534))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2535)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:49,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2541 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2541))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2534)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2535)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:17:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133302189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:49,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:49,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2025-02-06 12:17:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333595254] [2025-02-06 12:17:49,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:49,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 12:17:49,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:49,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 12:17:49,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=735, Unknown=24, NotChecked=434, Total=1332 [2025-02-06 12:17:49,872 INFO L87 Difference]: Start difference. First operand 1821 states and 2517 transitions. Second operand has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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:17:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:17:52,395 INFO L93 Difference]: Finished difference Result 1823 states and 2521 transitions. [2025-02-06 12:17:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 12:17:52,395 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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 107 [2025-02-06 12:17:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:17:52,397 INFO L225 Difference]: With dead ends: 1823 [2025-02-06 12:17:52,397 INFO L226 Difference]: Without dead ends: 1823 [2025-02-06 12:17:52,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=899, Unknown=24, NotChecked=476, Total=1560 [2025-02-06 12:17:52,397 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 863 mSDsluCounter, 8228 mSDsCounter, 0 mSdLazyCounter, 5957 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 8839 SdHoareTripleChecker+Invalid, 5978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:17:52,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 8839 Invalid, 5978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5957 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:17:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-02-06 12:17:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1820. [2025-02-06 12:17:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1514 states have (on average 1.6254953764861295) internal successors, (2461), 1808 states have internal predecessors, (2461), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:17:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2515 transitions. [2025-02-06 12:17:52,410 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2515 transitions. Word has length 107 [2025-02-06 12:17:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:17:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2515 transitions. [2025-02-06 12:17:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 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:17:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2515 transitions. [2025-02-06 12:17:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 12:17:52,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:17:52,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:17:52,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:17:52,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:52,612 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:17:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:17:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 435078779, now seen corresponding path program 1 times [2025-02-06 12:17:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:17:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784098758] [2025-02-06 12:17:52,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:17:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:17:52,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:17:52,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:52,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:53,338 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:17:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:17:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784098758] [2025-02-06 12:17:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784098758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876429989] [2025-02-06 12:17:53,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:17:53,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:17:53,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:17:53,340 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:17:53,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:17:53,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 12:17:53,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 12:17:53,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:17:53,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:17:53,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 12:17:53,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:17:53,584 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:17:53,645 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:17:53,654 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:17:53,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:17:53,683 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:17:53,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:17:53,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-02-06 12:17:53,764 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:17:53,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:53,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:17:53,883 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:17:53,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:53,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:17:53,954 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:17:54,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:54,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:17:54,004 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:17:54,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:54,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:17:54,060 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:17:54,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:17:54,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:17:54,117 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:17:54,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-02-06 12:17:54,139 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:17:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:17:54,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:17:54,201 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 12:17:54,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 12:17:54,222 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:17:54,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:17:54,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2736))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2735) .cse1 v_ArrVal_2738) (select (select (store .cse2 .cse1 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2740))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2736))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2737))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2735) .cse4 v_ArrVal_2738) .cse5 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse6 .cse5 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2025-02-06 12:17:54,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2734))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2736))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2733) .cse0 v_ArrVal_2735) .cse1 v_ArrVal_2738) (select (select (store .cse2 .cse1 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2740))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2734))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2736))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2737))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2733) .cse5 v_ArrVal_2735) .cse6 v_ArrVal_2738) .cse7 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse8 .cse7 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2025-02-06 12:17:54,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |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|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2734))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2736))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2733) .cse1 v_ArrVal_2735) .cse2 v_ArrVal_2738) (select (select (store .cse3 .cse2 v_ArrVal_2737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2740))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2737 (Array Int Int)) (v_ArrVal_2736 (Array Int Int)) (v_ArrVal_2735 (Array Int Int)) (v_ArrVal_2734 (Array Int Int)) (v_ArrVal_2733 (Array Int Int)) (v_ArrVal_2740 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2741 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2734))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2736))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2737))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2733) .cse6 v_ArrVal_2735) .cse7 v_ArrVal_2738) .cse8 v_ArrVal_2740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2741) (select (select (store .cse9 .cse8 v_ArrVal_2739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-02-06 12:17:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876429989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:17:59,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:17:59,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-02-06 12:17:59,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658004150] [2025-02-06 12:17:59,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:17:59,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 12:17:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:17:59,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 12:17:59,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1291, Unknown=42, NotChecked=228, Total=1722 [2025-02-06 12:17:59,345 INFO L87 Difference]: Start difference. First operand 1820 states and 2515 transitions. Second operand has 30 states, 27 states have (on average 6.407407407407407) internal successors, (173), 29 states have internal predecessors, (173), 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:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:04,277 INFO L93 Difference]: Finished difference Result 1822 states and 2519 transitions. [2025-02-06 12:18:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 12:18:04,278 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.407407407407407) internal successors, (173), 29 states have internal predecessors, (173), 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 107 [2025-02-06 12:18:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:04,280 INFO L225 Difference]: With dead ends: 1822 [2025-02-06 12:18:04,280 INFO L226 Difference]: Without dead ends: 1822 [2025-02-06 12:18:04,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=274, Invalid=2047, Unknown=43, NotChecked=288, Total=2652 [2025-02-06 12:18:04,281 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 873 mSDsluCounter, 8878 mSDsCounter, 0 mSdLazyCounter, 9103 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 9489 SdHoareTripleChecker+Invalid, 9131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:04,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 9489 Invalid, 9131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9103 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 12:18:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2025-02-06 12:18:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1784. [2025-02-06 12:18:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1480 states have (on average 1.6378378378378378) internal successors, (2424), 1774 states have internal predecessors, (2424), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 12:18:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2476 transitions. [2025-02-06 12:18:04,299 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2476 transitions. Word has length 107 [2025-02-06 12:18:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:04,299 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2476 transitions. [2025-02-06 12:18:04,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.407407407407407) internal successors, (173), 29 states have internal predecessors, (173), 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:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2476 transitions. [2025-02-06 12:18:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 12:18:04,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:04,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:04,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:18:04,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:04,504 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:18:04,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash 447494955, now seen corresponding path program 1 times [2025-02-06 12:18:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224942560] [2025-02-06 12:18:04,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:04,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 12:18:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 12:18:04,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:04,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:05,069 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,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224942560] [2025-02-06 12:18:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224942560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:18:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977707578] [2025-02-06 12:18:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:05,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:18:05,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:18:05,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:18:05,070 INFO L87 Difference]: Start difference. First operand 1784 states and 2476 transitions. Second operand has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 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:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:06,672 INFO L93 Difference]: Finished difference Result 1829 states and 2527 transitions. [2025-02-06 12:18:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:18:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 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 109 [2025-02-06 12:18:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:06,674 INFO L225 Difference]: With dead ends: 1829 [2025-02-06 12:18:06,674 INFO L226 Difference]: Without dead ends: 1829 [2025-02-06 12:18:06,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:18:06,675 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 916 mSDsluCounter, 4743 mSDsCounter, 0 mSdLazyCounter, 3620 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 5357 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:06,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 5357 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 12:18:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2025-02-06 12:18:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1825. [2025-02-06 12:18:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1520 states have (on average 1.6230263157894738) internal successors, (2467), 1813 states have internal predecessors, (2467), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:18:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2521 transitions. [2025-02-06 12:18:06,696 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2521 transitions. Word has length 109 [2025-02-06 12:18:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2521 transitions. [2025-02-06 12:18:06,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 15 states have internal predecessors, (107), 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:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2521 transitions. [2025-02-06 12:18:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 12:18:06,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:06,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:06,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 12:18:06,697 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:18:06,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash 447494956, now seen corresponding path program 1 times [2025-02-06 12:18:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597201465] [2025-02-06 12:18:06,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 12:18:06,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 12:18:06,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:06,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:07,864 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,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597201465] [2025-02-06 12:18:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597201465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 12:18:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189893426] [2025-02-06 12:18:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:07,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:18:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:07,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:18:07,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:18:07,865 INFO L87 Difference]: Start difference. First operand 1825 states and 2521 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 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:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:10,698 INFO L93 Difference]: Finished difference Result 1828 states and 2525 transitions. [2025-02-06 12:18:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 12:18:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 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 109 [2025-02-06 12:18:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:10,700 INFO L225 Difference]: With dead ends: 1828 [2025-02-06 12:18:10,700 INFO L226 Difference]: Without dead ends: 1828 [2025-02-06 12:18:10,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-02-06 12:18:10,701 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 906 mSDsluCounter, 5487 mSDsCounter, 0 mSdLazyCounter, 5847 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 6099 SdHoareTripleChecker+Invalid, 5868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:10,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 6099 Invalid, 5868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5847 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 12:18:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2025-02-06 12:18:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1825. [2025-02-06 12:18:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1520 states have (on average 1.6217105263157894) internal successors, (2465), 1813 states have internal predecessors, (2465), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:18:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2519 transitions. [2025-02-06 12:18:10,712 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2519 transitions. Word has length 109 [2025-02-06 12:18:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:10,712 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2519 transitions. [2025-02-06 12:18:10,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 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:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2519 transitions. [2025-02-06 12:18:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 12:18:10,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:10,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:10,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 12:18:10,714 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:18:10,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -778545224, now seen corresponding path program 1 times [2025-02-06 12:18:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536060232] [2025-02-06 12:18:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:10,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:18:10,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:18:10,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:10,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:18:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:10,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536060232] [2025-02-06 12:18:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536060232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:18:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:18:10,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:18:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070779738] [2025-02-06 12:18:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:18:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:18:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:18:10,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:18:10,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:18:10,994 INFO L87 Difference]: Start difference. First operand 1825 states and 2519 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:18:11,858 INFO L93 Difference]: Finished difference Result 1824 states and 2517 transitions. [2025-02-06 12:18:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:18:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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 110 [2025-02-06 12:18:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:18:11,860 INFO L225 Difference]: With dead ends: 1824 [2025-02-06 12:18:11,860 INFO L226 Difference]: Without dead ends: 1824 [2025-02-06 12:18:11,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:18:11,860 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 2 mSDsluCounter, 2669 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:18:11,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3619 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:18:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2025-02-06 12:18:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2025-02-06 12:18:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1520 states have (on average 1.6203947368421052) internal successors, (2463), 1812 states have internal predecessors, (2463), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2025-02-06 12:18:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2517 transitions. [2025-02-06 12:18:11,871 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2517 transitions. Word has length 110 [2025-02-06 12:18:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:18:11,871 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2517 transitions. [2025-02-06 12:18:11,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 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:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2517 transitions. [2025-02-06 12:18:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 12:18:11,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:18:11,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:18:11,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 12:18:11,872 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2025-02-06 12:18:11,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:18:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -778545223, now seen corresponding path program 1 times [2025-02-06 12:18:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:18:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468555022] [2025-02-06 12:18:11,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:18:11,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:18:11,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:18:11,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:11,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:12,849 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:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:18:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468555022] [2025-02-06 12:18:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468555022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:18:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226009878] [2025-02-06 12:18:12,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:18:12,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:18:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:18:12,852 INFO L229 MonitoredProcess]: Starting monitored process 12 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:12,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:18:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:18:13,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:18:13,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:18:13,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:18:13,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 12:18:13,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:18:13,097 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:13,188 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:18:13,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:18:13,196 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:13,221 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:13,230 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:13,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-02-06 12:18:13,333 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:13,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:13,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:18:13,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 12:18:13,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:13,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 73 treesize of output 66 [2025-02-06 12:18:13,588 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:13,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:13,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:18:13,661 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:13,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:13,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:18:13,732 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:13,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:13,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-06 12:18:13,806 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:13,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:18:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 12:18:13,914 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-02-06 12:18:13,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-02-06 12:18:13,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 12:18:13,945 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:13,952 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:13,965 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:13,968 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:13,970 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:13,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:18:14,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3243 (Array Int Int))) (<= 0 (+ 40 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int))) (<= (+ 44 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_3243) |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~mem60#1.base| v_ArrVal_3242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:18:14,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (<= 0 (+ 40 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3239) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3239 (Array Int Int))) (or (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3241 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3240))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 44 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3239) .cse1 v_ArrVal_3243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3241) (select (select (store .cse2 .cse1 v_ArrVal_3242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false [2025-02-06 12:18:14,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3240 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (or (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3241 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3238))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_3240))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3237) .cse0 v_ArrVal_3239) .cse1 v_ArrVal_3243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3241) (select (select (store .cse3 .cse1 v_ArrVal_3242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (or (forall ((v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3237 (Array Int Int)) (v_ArrVal_3238 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3238))) (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~mem58#1.base| v_ArrVal_3237) .cse5 v_ArrVal_3239) (select (select (store .cse6 .cse5 v_ArrVal_3240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3243))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))) is different from false