./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:22:51,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:22:51,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:22:51,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:22:51,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:22:51,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:22:51,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:22:51,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:22:51,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:22:51,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:22:51,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:22:51,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:22:51,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:22:51,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:22:51,880 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:22:51,881 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:22:51,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:22:51,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:22:51,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:22:51,881 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:22:51,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:22:51,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:51,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:22:51,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:51,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:22:51,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:22:51,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-01-10 00:22:52,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:22:52,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:22:52,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:22:52,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:22:52,142 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:22:52,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-01-10 00:22:53,319 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a34a27c6/0ae8ddfa95cb47408ca1e594db72593b/FLAG6a60dddcf [2025-01-10 00:22:53,657 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:22:53,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-01-10 00:22:53,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a34a27c6/0ae8ddfa95cb47408ca1e594db72593b/FLAG6a60dddcf [2025-01-10 00:22:53,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a34a27c6/0ae8ddfa95cb47408ca1e594db72593b [2025-01-10 00:22:53,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:22:53,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:22:53,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:22:53,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:22:53,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:22:53,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:22:53" (1/1) ... [2025-01-10 00:22:53,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6d6ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:53, skipping insertion in model container [2025-01-10 00:22:53,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:22:53" (1/1) ... [2025-01-10 00:22:53,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:22:53,957 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:53,987 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:53,989 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:53,992 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:53,996 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:54,025 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:54,026 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:54,027 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:54,027 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:22:54,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:22:54,041 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:22:54,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:22:54,142 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:22:54,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54 WrapperNode [2025-01-10 00:22:54,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:22:54,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:22:54,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:22:54,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:22:54,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,246 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1251 [2025-01-10 00:22:54,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:22:54,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:22:54,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:22:54,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:22:54,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,291 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-01-10 00:22:54,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:22:54,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:22:54,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:22:54,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:22:54,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (1/1) ... [2025-01-10 00:22:54,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:54,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:54,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:22:54,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 00:22:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:22:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:22:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:22:54,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:22:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:22:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:22:54,592 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:22:54,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:22:54,596 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:54,639 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:54,661 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:56,018 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2025-01-10 00:22:56,018 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:22:56,039 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:22:56,039 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 00:22:56,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:22:56 BoogieIcfgContainer [2025-01-10 00:22:56,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:22:56,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:22:56,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:22:56,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:22:56,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:22:53" (1/3) ... [2025-01-10 00:22:56,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7d8937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:22:56, skipping insertion in model container [2025-01-10 00:22:56,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:54" (2/3) ... [2025-01-10 00:22:56,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7d8937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:22:56, skipping insertion in model container [2025-01-10 00:22:56,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:22:56" (3/3) ... [2025-01-10 00:22:56,045 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2025-01-10 00:22:56,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:22:56,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test2-1.i that has 4 procedures, 1061 locations, 1 initial locations, 33 loop locations, and 420 error locations. [2025-01-10 00:22:56,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:22:56,096 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;@5289fa71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:22:56,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2025-01-10 00:22:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 1051 states, 629 states have (on average 2.011128775834658) internal successors, (1265), 1046 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:22:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 00:22:56,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:56,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 00:22:56,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:22:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1758837, now seen corresponding path program 1 times [2025-01-10 00:22:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813158562] [2025-01-10 00:22:56,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:56,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:22:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:22:56,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:56,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:56,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813158562] [2025-01-10 00:22:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813158562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:56,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:56,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508623137] [2025-01-10 00:22:56,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:56,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:56,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:56,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:56,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:56,335 INFO L87 Difference]: Start difference. First operand has 1051 states, 629 states have (on average 2.011128775834658) internal successors, (1265), 1046 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:57,067 INFO L93 Difference]: Finished difference Result 1347 states and 1600 transitions. [2025-01-10 00:22:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 00:22:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:57,085 INFO L225 Difference]: With dead ends: 1347 [2025-01-10 00:22:57,085 INFO L226 Difference]: Without dead ends: 1343 [2025-01-10 00:22:57,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:57,088 INFO L435 NwaCegarLoop]: 1096 mSDtfsCounter, 382 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:57,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 2642 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:22:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-01-10 00:22:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1257. [2025-01-10 00:22:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 841 states have (on average 1.8846611177170036) internal successors, (1585), 1252 states have internal predecessors, (1585), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:22:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1591 transitions. [2025-01-10 00:22:57,164 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1591 transitions. Word has length 4 [2025-01-10 00:22:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:57,164 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1591 transitions. [2025-01-10 00:22:57,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1591 transitions. [2025-01-10 00:22:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 00:22:57,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:57,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 00:22:57,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:22:57,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:22:57,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2025-01-10 00:22:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625796023] [2025-01-10 00:22:57,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:57,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:22:57,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:22:57,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:57,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625796023] [2025-01-10 00:22:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625796023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640458320] [2025-01-10 00:22:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:57,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:57,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:57,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:57,240 INFO L87 Difference]: Start difference. First operand 1257 states and 1591 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:57,726 INFO L93 Difference]: Finished difference Result 1254 states and 1583 transitions. [2025-01-10 00:22:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:57,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 00:22:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:57,731 INFO L225 Difference]: With dead ends: 1254 [2025-01-10 00:22:57,731 INFO L226 Difference]: Without dead ends: 1254 [2025-01-10 00:22:57,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:57,733 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1084 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:57,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 859 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:22:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-01-10 00:22:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-01-10 00:22:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 849 states have (on average 1.8574793875147233) internal successors, (1577), 1249 states have internal predecessors, (1577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:22:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1583 transitions. [2025-01-10 00:22:57,764 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1583 transitions. Word has length 4 [2025-01-10 00:22:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1583 transitions. [2025-01-10 00:22:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1583 transitions. [2025-01-10 00:22:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 00:22:57,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:57,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 00:22:57,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:22:57,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:22:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2025-01-10 00:22:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314544641] [2025-01-10 00:22:57,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:57,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:22:57,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:22:57,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:57,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:57,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:57,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314544641] [2025-01-10 00:22:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314544641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632960853] [2025-01-10 00:22:57,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:57,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:57,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:57,855 INFO L87 Difference]: Start difference. First operand 1254 states and 1583 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:58,544 INFO L93 Difference]: Finished difference Result 2012 states and 2486 transitions. [2025-01-10 00:22:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:58,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 00:22:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:58,550 INFO L225 Difference]: With dead ends: 2012 [2025-01-10 00:22:58,550 INFO L226 Difference]: Without dead ends: 2012 [2025-01-10 00:22:58,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:58,551 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 902 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:58,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1689 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:22:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2025-01-10 00:22:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1750. [2025-01-10 00:22:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1346 states have (on average 1.8313521545319464) internal successors, (2465), 1743 states have internal predecessors, (2465), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:22:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2475 transitions. [2025-01-10 00:22:58,577 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2475 transitions. Word has length 4 [2025-01-10 00:22:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:58,578 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2475 transitions. [2025-01-10 00:22:58,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2475 transitions. [2025-01-10 00:22:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:22:58,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:58,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:58,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:22:58,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:22:58,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235122, now seen corresponding path program 1 times [2025-01-10 00:22:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498673345] [2025-01-10 00:22:58,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:58,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:22:58,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:22:58,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:58,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498673345] [2025-01-10 00:22:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498673345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:58,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196497407] [2025-01-10 00:22:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:58,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:58,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:58,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:58,622 INFO L87 Difference]: Start difference. First operand 1750 states and 2475 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:59,057 INFO L93 Difference]: Finished difference Result 1789 states and 2407 transitions. [2025-01-10 00:22:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 00:22:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:59,062 INFO L225 Difference]: With dead ends: 1789 [2025-01-10 00:22:59,062 INFO L226 Difference]: Without dead ends: 1789 [2025-01-10 00:22:59,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:59,062 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 1069 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:59,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1416 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2025-01-10 00:22:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1703. [2025-01-10 00:22:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1346 states have (on average 1.7786032689450222) internal successors, (2394), 1696 states have internal predecessors, (2394), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:22:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2404 transitions. [2025-01-10 00:22:59,086 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2404 transitions. Word has length 10 [2025-01-10 00:22:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:59,086 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2404 transitions. [2025-01-10 00:22:59,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2404 transitions. [2025-01-10 00:22:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:22:59,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:59,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:22:59,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:22:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1952235123, now seen corresponding path program 1 times [2025-01-10 00:22:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:59,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942526741] [2025-01-10 00:22:59,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:59,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:22:59,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:22:59,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:59,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942526741] [2025-01-10 00:22:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942526741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011263445] [2025-01-10 00:22:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:59,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:59,147 INFO L87 Difference]: Start difference. First operand 1703 states and 2404 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:59,590 INFO L93 Difference]: Finished difference Result 1997 states and 2749 transitions. [2025-01-10 00:22:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:59,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 00:22:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:59,595 INFO L225 Difference]: With dead ends: 1997 [2025-01-10 00:22:59,595 INFO L226 Difference]: Without dead ends: 1997 [2025-01-10 00:22:59,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:59,596 INFO L435 NwaCegarLoop]: 1250 mSDtfsCounter, 862 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:59,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1663 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2025-01-10 00:22:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1678. [2025-01-10 00:22:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1346 states have (on average 1.7421991084695394) internal successors, (2345), 1671 states have internal predecessors, (2345), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:22:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2355 transitions. [2025-01-10 00:22:59,619 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2355 transitions. Word has length 10 [2025-01-10 00:22:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:59,619 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2355 transitions. [2025-01-10 00:22:59,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2355 transitions. [2025-01-10 00:22:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 00:22:59,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:59,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:59,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:22:59,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:22:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 851242140, now seen corresponding path program 1 times [2025-01-10 00:22:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874090830] [2025-01-10 00:22:59,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:59,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:22:59,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:22:59,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:59,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:59,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:59,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874090830] [2025-01-10 00:22:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874090830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:59,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:59,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:59,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801570018] [2025-01-10 00:22:59,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:59,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:59,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:59,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:59,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:59,686 INFO L87 Difference]: Start difference. First operand 1678 states and 2355 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:00,174 INFO L93 Difference]: Finished difference Result 1802 states and 2514 transitions. [2025-01-10 00:23:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:23:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-01-10 00:23:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:00,179 INFO L225 Difference]: With dead ends: 1802 [2025-01-10 00:23:00,179 INFO L226 Difference]: Without dead ends: 1802 [2025-01-10 00:23:00,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:00,180 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1283 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:00,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1397 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:23:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2025-01-10 00:23:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1655. [2025-01-10 00:23:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1346 states have (on average 1.6909361069836553) internal successors, (2276), 1648 states have internal predecessors, (2276), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2286 transitions. [2025-01-10 00:23:00,199 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2286 transitions. Word has length 14 [2025-01-10 00:23:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:00,199 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2286 transitions. [2025-01-10 00:23:00,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2286 transitions. [2025-01-10 00:23:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 00:23:00,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:00,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:00,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:23:00,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:00,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash 851242141, now seen corresponding path program 1 times [2025-01-10 00:23:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536884550] [2025-01-10 00:23:00,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:23:00,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:23:00,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:00,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536884550] [2025-01-10 00:23:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536884550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:23:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179180542] [2025-01-10 00:23:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:00,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:00,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:00,295 INFO L87 Difference]: Start difference. First operand 1655 states and 2286 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:01,017 INFO L93 Difference]: Finished difference Result 2154 states and 2767 transitions. [2025-01-10 00:23:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:23:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-01-10 00:23:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:01,022 INFO L225 Difference]: With dead ends: 2154 [2025-01-10 00:23:01,022 INFO L226 Difference]: Without dead ends: 2154 [2025-01-10 00:23:01,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:01,023 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1274 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:01,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 2246 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:23:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2025-01-10 00:23:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1749. [2025-01-10 00:23:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1440 states have (on average 1.6722222222222223) internal successors, (2408), 1742 states have internal predecessors, (2408), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2418 transitions. [2025-01-10 00:23:01,043 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2418 transitions. Word has length 14 [2025-01-10 00:23:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:01,043 INFO L471 AbstractCegarLoop]: Abstraction has 1749 states and 2418 transitions. [2025-01-10 00:23:01,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2418 transitions. [2025-01-10 00:23:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:23:01,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:01,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:01,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:23:01,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:01,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 618919425, now seen corresponding path program 1 times [2025-01-10 00:23:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:01,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348673775] [2025-01-10 00:23:01,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:01,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:23:01,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:23:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348673775] [2025-01-10 00:23:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348673775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:23:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689119376] [2025-01-10 00:23:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:01,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:01,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:01,088 INFO L87 Difference]: Start difference. First operand 1749 states and 2418 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:01,132 INFO L93 Difference]: Finished difference Result 1423 states and 1903 transitions. [2025-01-10 00:23:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:23:01,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2025-01-10 00:23:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:01,136 INFO L225 Difference]: With dead ends: 1423 [2025-01-10 00:23:01,136 INFO L226 Difference]: Without dead ends: 1423 [2025-01-10 00:23:01,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:01,136 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 45 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:01,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2806 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:23:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-01-10 00:23:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2025-01-10 00:23:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1133 states have (on average 1.6707855251544572) internal successors, (1893), 1416 states have internal predecessors, (1893), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1903 transitions. [2025-01-10 00:23:01,151 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1903 transitions. Word has length 15 [2025-01-10 00:23:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:01,152 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1903 transitions. [2025-01-10 00:23:01,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1903 transitions. [2025-01-10 00:23:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 00:23:01,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:01,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:01,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:23:01,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:01,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969598, now seen corresponding path program 1 times [2025-01-10 00:23:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205438083] [2025-01-10 00:23:01,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:23:01,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:23:01,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:01,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205438083] [2025-01-10 00:23:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205438083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:23:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7768802] [2025-01-10 00:23:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:01,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:01,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:01,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:01,196 INFO L87 Difference]: Start difference. First operand 1423 states and 1903 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:01,725 INFO L93 Difference]: Finished difference Result 1538 states and 2012 transitions. [2025-01-10 00:23:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:23:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 00:23:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:01,730 INFO L225 Difference]: With dead ends: 1538 [2025-01-10 00:23:01,730 INFO L226 Difference]: Without dead ends: 1538 [2025-01-10 00:23:01,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:01,733 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 1179 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:01,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1650 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:23:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-01-10 00:23:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1400. [2025-01-10 00:23:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1133 states have (on average 1.6301853486319506) internal successors, (1847), 1393 states have internal predecessors, (1847), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1857 transitions. [2025-01-10 00:23:01,749 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1857 transitions. Word has length 20 [2025-01-10 00:23:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:01,750 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1857 transitions. [2025-01-10 00:23:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1857 transitions. [2025-01-10 00:23:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 00:23:01,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:01,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:01,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:23:01,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:01,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2113969599, now seen corresponding path program 1 times [2025-01-10 00:23:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354328890] [2025-01-10 00:23:01,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:01,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:23:01,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:23:01,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:01,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:01,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354328890] [2025-01-10 00:23:01,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354328890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:01,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:01,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:23:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234053531] [2025-01-10 00:23:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:01,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:23:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:01,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:23:01,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:23:01,799 INFO L87 Difference]: Start difference. First operand 1400 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:01,816 INFO L93 Difference]: Finished difference Result 1262 states and 1651 transitions. [2025-01-10 00:23:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:23:01,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 00:23:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:01,822 INFO L225 Difference]: With dead ends: 1262 [2025-01-10 00:23:01,822 INFO L226 Difference]: Without dead ends: 1262 [2025-01-10 00:23:01,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:23:01,823 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 60 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:01,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1601 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:23:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-01-10 00:23:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1262. [2025-01-10 00:23:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1007 states have (on average 1.6295928500496524) internal successors, (1641), 1255 states have internal predecessors, (1641), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1651 transitions. [2025-01-10 00:23:01,835 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1651 transitions. Word has length 20 [2025-01-10 00:23:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:01,835 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1651 transitions. [2025-01-10 00:23:01,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1651 transitions. [2025-01-10 00:23:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 00:23:01,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:01,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:01,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:23:01,836 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:01,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1108763704, now seen corresponding path program 1 times [2025-01-10 00:23:01,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:01,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277833330] [2025-01-10 00:23:01,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:01,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:23:01,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:23:01,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:01,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:01,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:01,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277833330] [2025-01-10 00:23:01,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277833330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:01,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:01,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:23:01,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054814874] [2025-01-10 00:23:01,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:01,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:01,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:01,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:01,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:01,878 INFO L87 Difference]: Start difference. First operand 1262 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:01,938 INFO L93 Difference]: Finished difference Result 1233 states and 1601 transitions. [2025-01-10 00:23:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:23:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 00:23:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:01,944 INFO L225 Difference]: With dead ends: 1233 [2025-01-10 00:23:01,944 INFO L226 Difference]: Without dead ends: 1233 [2025-01-10 00:23:01,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:01,945 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 41 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:01,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2348 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:23:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-01-10 00:23:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1227. [2025-01-10 00:23:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 979 states have (on average 1.6189989785495404) internal successors, (1585), 1220 states have internal predecessors, (1585), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1595 transitions. [2025-01-10 00:23:01,957 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1595 transitions. Word has length 21 [2025-01-10 00:23:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:01,958 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1595 transitions. [2025-01-10 00:23:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1595 transitions. [2025-01-10 00:23:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 00:23:01,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:01,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:23:01,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -685715770, now seen corresponding path program 1 times [2025-01-10 00:23:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496197054] [2025-01-10 00:23:01,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:01,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 00:23:01,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 00:23:01,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:01,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496197054] [2025-01-10 00:23:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496197054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:23:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353326531] [2025-01-10 00:23:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:02,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:02,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:02,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:02,063 INFO L87 Difference]: Start difference. First operand 1227 states and 1595 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:02,651 INFO L93 Difference]: Finished difference Result 1809 states and 2391 transitions. [2025-01-10 00:23:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:23:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-10 00:23:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:02,656 INFO L225 Difference]: With dead ends: 1809 [2025-01-10 00:23:02,656 INFO L226 Difference]: Without dead ends: 1809 [2025-01-10 00:23:02,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:02,657 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 657 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:02,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1901 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:23:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-01-10 00:23:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1223. [2025-01-10 00:23:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 979 states have (on average 1.6108273748723188) internal successors, (1577), 1216 states have internal predecessors, (1577), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1587 transitions. [2025-01-10 00:23:02,671 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1587 transitions. Word has length 35 [2025-01-10 00:23:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:02,672 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1587 transitions. [2025-01-10 00:23:02,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1587 transitions. [2025-01-10 00:23:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 00:23:02,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:02,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:23:02,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -607235323, now seen corresponding path program 1 times [2025-01-10 00:23:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650842979] [2025-01-10 00:23:02,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:02,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 00:23:02,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 00:23:02,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:02,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650842979] [2025-01-10 00:23:02,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650842979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:02,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:02,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:23:02,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427230702] [2025-01-10 00:23:02,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:02,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:02,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:02,769 INFO L87 Difference]: Start difference. First operand 1223 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:02,800 INFO L93 Difference]: Finished difference Result 1205 states and 1557 transitions. [2025-01-10 00:23:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:23:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-10 00:23:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:02,802 INFO L225 Difference]: With dead ends: 1205 [2025-01-10 00:23:02,802 INFO L226 Difference]: Without dead ends: 1205 [2025-01-10 00:23:02,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:02,803 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 27 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:02,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2324 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:23:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-01-10 00:23:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2025-01-10 00:23:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 961 states have (on average 1.6097814776274715) internal successors, (1547), 1198 states have internal predecessors, (1547), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1557 transitions. [2025-01-10 00:23:02,814 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1557 transitions. Word has length 61 [2025-01-10 00:23:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:02,815 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1557 transitions. [2025-01-10 00:23:02,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1557 transitions. [2025-01-10 00:23:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 00:23:02,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:02,816 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-01-10 00:23:02,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:23:02,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:02,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -409784751, now seen corresponding path program 1 times [2025-01-10 00:23:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567961152] [2025-01-10 00:23:02,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:02,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 00:23:02,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 00:23:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567961152] [2025-01-10 00:23:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567961152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:23:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070854462] [2025-01-10 00:23:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:23:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:02,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:23:02,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:23:02,925 INFO L87 Difference]: Start difference. First operand 1205 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:02,967 INFO L93 Difference]: Finished difference Result 1468 states and 1862 transitions. [2025-01-10 00:23:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:23:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-10 00:23:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:02,971 INFO L225 Difference]: With dead ends: 1468 [2025-01-10 00:23:02,971 INFO L226 Difference]: Without dead ends: 1468 [2025-01-10 00:23:02,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:23:02,973 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 205 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:02,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1563 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:23:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-01-10 00:23:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1455. [2025-01-10 00:23:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1211 states have (on average 1.5260115606936415) internal successors, (1848), 1448 states have internal predecessors, (1848), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1858 transitions. [2025-01-10 00:23:02,991 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1858 transitions. Word has length 69 [2025-01-10 00:23:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:02,991 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 1858 transitions. [2025-01-10 00:23:02,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1858 transitions. [2025-01-10 00:23:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 00:23:02,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:02,993 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] [2025-01-10 00:23:02,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:23:02,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:02,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1925203483, now seen corresponding path program 1 times [2025-01-10 00:23:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008316580] [2025-01-10 00:23:02,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:03,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 00:23:03,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 00:23:03,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:03,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008316580] [2025-01-10 00:23:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008316580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:03,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:23:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875033017] [2025-01-10 00:23:03,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:03,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:23:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:03,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:23:03,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:23:03,324 INFO L87 Difference]: Start difference. First operand 1455 states and 1858 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:03,493 INFO L93 Difference]: Finished difference Result 2073 states and 2589 transitions. [2025-01-10 00:23:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:23:03,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 75 [2025-01-10 00:23:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:03,508 INFO L225 Difference]: With dead ends: 2073 [2025-01-10 00:23:03,515 INFO L226 Difference]: Without dead ends: 2070 [2025-01-10 00:23:03,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:23:03,516 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 731 mSDsluCounter, 3795 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:03,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 4570 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:23:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2025-01-10 00:23:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1357. [2025-01-10 00:23:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1113 states have (on average 1.5462713387241689) internal successors, (1721), 1350 states have internal predecessors, (1721), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1731 transitions. [2025-01-10 00:23:03,557 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1731 transitions. Word has length 75 [2025-01-10 00:23:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:03,557 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1731 transitions. [2025-01-10 00:23:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:23:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1731 transitions. [2025-01-10 00:23:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 00:23:03,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:03,558 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-01-10 00:23:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:23:03,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1057223025, now seen corresponding path program 1 times [2025-01-10 00:23:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668946026] [2025-01-10 00:23:03,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:03,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 00:23:03,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:23:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:03,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-01-10 00:23:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668946026] [2025-01-10 00:23:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668946026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:03,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:03,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:23:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143308927] [2025-01-10 00:23:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:03,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:23:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:03,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:23:03,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:23:03,725 INFO L87 Difference]: Start difference. First operand 1357 states and 1731 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-01-10 00:23:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:03,763 INFO L93 Difference]: Finished difference Result 1357 states and 1719 transitions. [2025-01-10 00:23:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:23:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-01-10 00:23:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:03,765 INFO L225 Difference]: With dead ends: 1357 [2025-01-10 00:23:03,765 INFO L226 Difference]: Without dead ends: 1357 [2025-01-10 00:23:03,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:03,766 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 21 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:03,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2318 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:23:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-01-10 00:23:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2025-01-10 00:23:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1113 states have (on average 1.5354896675651393) internal successors, (1709), 1350 states have internal predecessors, (1709), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1719 transitions. [2025-01-10 00:23:03,779 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1719 transitions. Word has length 77 [2025-01-10 00:23:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:03,779 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1719 transitions. [2025-01-10 00:23:03,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-01-10 00:23:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1719 transitions. [2025-01-10 00:23:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:23:03,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:03,780 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-01-10 00:23:03,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:23:03,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -741117861, now seen corresponding path program 1 times [2025-01-10 00:23:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41115662] [2025-01-10 00:23:03,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:03,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:23:03,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:23:03,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:03,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:03,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41115662] [2025-01-10 00:23:03,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41115662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:03,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:03,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:23:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111333155] [2025-01-10 00:23:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:03,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:23:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:03,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:23:03,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:03,979 INFO L87 Difference]: Start difference. First operand 1357 states and 1719 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-01-10 00:23:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:04,556 INFO L93 Difference]: Finished difference Result 1356 states and 1717 transitions. [2025-01-10 00:23:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:23:04,557 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-01-10 00:23:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:04,562 INFO L225 Difference]: With dead ends: 1356 [2025-01-10 00:23:04,562 INFO L226 Difference]: Without dead ends: 1356 [2025-01-10 00:23:04,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:23:04,562 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 2 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:04,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2319 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:23:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-01-10 00:23:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2025-01-10 00:23:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1113 states have (on average 1.5336927223719676) internal successors, (1707), 1349 states have internal predecessors, (1707), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1717 transitions. [2025-01-10 00:23:04,581 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1717 transitions. Word has length 85 [2025-01-10 00:23:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:04,582 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1717 transitions. [2025-01-10 00:23:04,582 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-01-10 00:23:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1717 transitions. [2025-01-10 00:23:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:23:04,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:04,583 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-01-10 00:23:04,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:23:04,583 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:04,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -741117860, now seen corresponding path program 1 times [2025-01-10 00:23:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181827374] [2025-01-10 00:23:04,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:04,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:23:04,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:23:04,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:04,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181827374] [2025-01-10 00:23:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181827374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:05,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:23:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372527611] [2025-01-10 00:23:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:05,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:23:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:05,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:23:05,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:23:05,031 INFO L87 Difference]: Start difference. First operand 1356 states and 1717 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-01-10 00:23:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:06,238 INFO L93 Difference]: Finished difference Result 1355 states and 1715 transitions. [2025-01-10 00:23:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:23:06,239 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-01-10 00:23:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:06,242 INFO L225 Difference]: With dead ends: 1355 [2025-01-10 00:23:06,242 INFO L226 Difference]: Without dead ends: 1355 [2025-01-10 00:23:06,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:23:06,243 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:06,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2245 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:23:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-01-10 00:23:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2025-01-10 00:23:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1111 states have (on average 1.5346534653465347) internal successors, (1705), 1348 states have internal predecessors, (1705), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1715 transitions. [2025-01-10 00:23:06,261 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1715 transitions. Word has length 85 [2025-01-10 00:23:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:06,262 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1715 transitions. [2025-01-10 00:23:06,262 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-01-10 00:23:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1715 transitions. [2025-01-10 00:23:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:23:06,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:06,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:06,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:23:06,263 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1001766530, now seen corresponding path program 1 times [2025-01-10 00:23:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:06,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466191834] [2025-01-10 00:23:06,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:06,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:23:06,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:23:06,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:06,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466191834] [2025-01-10 00:23:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466191834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:23:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417174857] [2025-01-10 00:23:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:23:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:06,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:23:06,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:23:06,440 INFO L87 Difference]: Start difference. First operand 1355 states and 1715 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-01-10 00:23:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:07,015 INFO L93 Difference]: Finished difference Result 1373 states and 1741 transitions. [2025-01-10 00:23:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:23:07,016 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-01-10 00:23:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:07,019 INFO L225 Difference]: With dead ends: 1373 [2025-01-10 00:23:07,022 INFO L226 Difference]: Without dead ends: 1373 [2025-01-10 00:23:07,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:23:07,025 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 6 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:07,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3624 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:23:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-01-10 00:23:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1364. [2025-01-10 00:23:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1119 states have (on average 1.5335120643431635) internal successors, (1716), 1355 states have internal predecessors, (1716), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 00:23:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1731 transitions. [2025-01-10 00:23:07,044 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1731 transitions. Word has length 93 [2025-01-10 00:23:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1731 transitions. [2025-01-10 00:23:07,045 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-01-10 00:23:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1731 transitions. [2025-01-10 00:23:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:23:07,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:07,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:07,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:23:07,046 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:07,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1001766531, now seen corresponding path program 1 times [2025-01-10 00:23:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:07,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209240530] [2025-01-10 00:23:07,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:07,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:07,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:23:07,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:23:07,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:07,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:07,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209240530] [2025-01-10 00:23:07,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209240530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:07,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:07,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:23:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783568043] [2025-01-10 00:23:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:07,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:23:07,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:07,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:23:07,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:23:07,382 INFO L87 Difference]: Start difference. First operand 1364 states and 1731 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-01-10 00:23:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:07,998 INFO L93 Difference]: Finished difference Result 1364 states and 1729 transitions. [2025-01-10 00:23:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:23:07,998 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-01-10 00:23:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:08,001 INFO L225 Difference]: With dead ends: 1364 [2025-01-10 00:23:08,001 INFO L226 Difference]: Without dead ends: 1364 [2025-01-10 00:23:08,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:23:08,002 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:08,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2914 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:23:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-01-10 00:23:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2025-01-10 00:23:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1119 states have (on average 1.5317247542448615) internal successors, (1714), 1355 states have internal predecessors, (1714), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 00:23:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1729 transitions. [2025-01-10 00:23:08,017 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1729 transitions. Word has length 93 [2025-01-10 00:23:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1729 transitions. [2025-01-10 00:23:08,018 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-01-10 00:23:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1729 transitions. [2025-01-10 00:23:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:23:08,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:08,018 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-01-10 00:23:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:23:08,019 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1590337999, now seen corresponding path program 1 times [2025-01-10 00:23:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576973565] [2025-01-10 00:23:08,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:08,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:23:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:23:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:08,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576973565] [2025-01-10 00:23:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576973565] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519014859] [2025-01-10 00:23:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:08,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:08,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:23:08,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:23:08,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:23:08,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:08,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:08,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 00:23:08,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:08,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:08,644 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:08,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:23:08,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:08,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:08,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:08,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:08,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:08,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519014859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:08,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:08,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2025-01-10 00:23:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056584675] [2025-01-10 00:23:08,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:23:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:08,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:23:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=319, Unknown=5, NotChecked=0, Total=380 [2025-01-10 00:23:08,946 INFO L87 Difference]: Start difference. First operand 1364 states and 1729 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-01-10 00:23:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:10,465 INFO L93 Difference]: Finished difference Result 1371 states and 1735 transitions. [2025-01-10 00:23:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:10,466 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-01-10 00:23:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:10,468 INFO L225 Difference]: With dead ends: 1371 [2025-01-10 00:23:10,468 INFO L226 Difference]: Without dead ends: 1371 [2025-01-10 00:23:10,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=463, Unknown=6, NotChecked=0, Total=552 [2025-01-10 00:23:10,469 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 707 mSDsluCounter, 4866 mSDsCounter, 0 mSdLazyCounter, 3344 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 5365 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:10,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 5365 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3344 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:23:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-01-10 00:23:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1368. [2025-01-10 00:23:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1123 states have (on average 1.528940338379341) internal successors, (1717), 1358 states have internal predecessors, (1717), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1729 transitions. [2025-01-10 00:23:10,483 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1729 transitions. Word has length 94 [2025-01-10 00:23:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:10,483 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 1729 transitions. [2025-01-10 00:23:10,483 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-01-10 00:23:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1729 transitions. [2025-01-10 00:23:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:23:10,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:10,485 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-01-10 00:23:10,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:23:10,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:10,686 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1590338000, now seen corresponding path program 1 times [2025-01-10 00:23:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736130485] [2025-01-10 00:23:10,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:23:10,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:23:10,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:10,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736130485] [2025-01-10 00:23:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736130485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807312447] [2025-01-10 00:23:11,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:11,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:11,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:23:11,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:23:11,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:23:11,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:11,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 00:23:11,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:11,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:11,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:11,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:23:11,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:23:11,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:11,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 00:23:11,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:11,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:23:11,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:11,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:23:11,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:23:11,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:11,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:23:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:11,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:12,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_783 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:23:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807312447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:12,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:12,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-01-10 00:23:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830927145] [2025-01-10 00:23:12,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:12,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:23:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:12,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:23:12,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-01-10 00:23:12,180 INFO L87 Difference]: Start difference. First operand 1368 states and 1729 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-01-10 00:23:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:13,911 INFO L93 Difference]: Finished difference Result 1370 states and 1733 transitions. [2025-01-10 00:23:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:23:13,911 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-01-10 00:23:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:13,914 INFO L225 Difference]: With dead ends: 1370 [2025-01-10 00:23:13,914 INFO L226 Difference]: Without dead ends: 1370 [2025-01-10 00:23:13,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2025-01-10 00:23:13,920 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 703 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:13,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 4191 Invalid, 3769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:23:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-01-10 00:23:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1358. [2025-01-10 00:23:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1115 states have (on average 1.5300448430493274) internal successors, (1706), 1350 states have internal predecessors, (1706), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1716 transitions. [2025-01-10 00:23:13,944 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1716 transitions. Word has length 94 [2025-01-10 00:23:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:13,944 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1716 transitions. [2025-01-10 00:23:13,944 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-01-10 00:23:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1716 transitions. [2025-01-10 00:23:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:23:13,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:13,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:13,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:23:14,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:14,150 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2100409119, now seen corresponding path program 1 times [2025-01-10 00:23:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913684588] [2025-01-10 00:23:14,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:14,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:23:14,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:23:14,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:14,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913684588] [2025-01-10 00:23:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913684588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:14,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:23:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700994947] [2025-01-10 00:23:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:14,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:23:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:14,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:23:14,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:23:14,578 INFO L87 Difference]: Start difference. First operand 1358 states and 1716 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-01-10 00:23:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:15,841 INFO L93 Difference]: Finished difference Result 1377 states and 1741 transitions. [2025-01-10 00:23:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:23:15,842 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-01-10 00:23:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:15,844 INFO L225 Difference]: With dead ends: 1377 [2025-01-10 00:23:15,846 INFO L226 Difference]: Without dead ends: 1377 [2025-01-10 00:23:15,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:23:15,847 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 713 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 2779 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 4403 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:15,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 4403 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2779 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:23:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-01-10 00:23:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1373. [2025-01-10 00:23:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1129 states have (on average 1.5261293179805138) internal successors, (1723), 1363 states have internal predecessors, (1723), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1735 transitions. [2025-01-10 00:23:15,858 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1735 transitions. Word has length 96 [2025-01-10 00:23:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:15,858 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1735 transitions. [2025-01-10 00:23:15,859 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-01-10 00:23:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1735 transitions. [2025-01-10 00:23:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 00:23:15,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:15,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:23:15,860 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:15,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2100409118, now seen corresponding path program 1 times [2025-01-10 00:23:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442698992] [2025-01-10 00:23:15,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:15,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 00:23:15,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 00:23:15,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:15,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:16,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442698992] [2025-01-10 00:23:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442698992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:16,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:16,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:23:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190354653] [2025-01-10 00:23:16,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:16,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:23:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:16,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:23:16,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:23:16,320 INFO L87 Difference]: Start difference. First operand 1373 states and 1735 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-01-10 00:23:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:17,624 INFO L93 Difference]: Finished difference Result 1376 states and 1739 transitions. [2025-01-10 00:23:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:23:17,624 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-01-10 00:23:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:17,626 INFO L225 Difference]: With dead ends: 1376 [2025-01-10 00:23:17,626 INFO L226 Difference]: Without dead ends: 1376 [2025-01-10 00:23:17,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:23:17,627 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 712 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:17,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3441 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:23:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-01-10 00:23:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2025-01-10 00:23:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1129 states have (on average 1.5243578387953942) internal successors, (1721), 1363 states have internal predecessors, (1721), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1733 transitions. [2025-01-10 00:23:17,635 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1733 transitions. Word has length 96 [2025-01-10 00:23:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:17,636 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1733 transitions. [2025-01-10 00:23:17,636 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-01-10 00:23:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1733 transitions. [2025-01-10 00:23:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:23:17,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:17,637 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-01-10 00:23:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:23:17,637 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:17,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash -24278412, now seen corresponding path program 1 times [2025-01-10 00:23:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:17,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364529759] [2025-01-10 00:23:17,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:17,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:23:17,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:23:17,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:17,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364529759] [2025-01-10 00:23:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364529759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517007911] [2025-01-10 00:23:17,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:17,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:17,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:17,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:23:18,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:23:18,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:23:18,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:18,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:18,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 00:23:18,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:18,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:18,254 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:18,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:23:18,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:18,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:18,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:18,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:18,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:18,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:18,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:18,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:18,622 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:23:18,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1064 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1064)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517007911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:18,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-01-10 00:23:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566259876] [2025-01-10 00:23:18,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:18,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:23:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:18,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:23:18,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=425, Unknown=9, NotChecked=86, Total=600 [2025-01-10 00:23:18,679 INFO L87 Difference]: Start difference. First operand 1373 states and 1733 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-01-10 00:23:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:20,384 INFO L93 Difference]: Finished difference Result 1375 states and 1737 transitions. [2025-01-10 00:23:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:20,388 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-01-10 00:23:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:20,390 INFO L225 Difference]: With dead ends: 1375 [2025-01-10 00:23:20,390 INFO L226 Difference]: Without dead ends: 1375 [2025-01-10 00:23:20,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=547, Unknown=9, NotChecked=98, Total=756 [2025-01-10 00:23:20,391 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 696 mSDsluCounter, 5348 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 5846 SdHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:20,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 5846 Invalid, 3682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:23:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-10 00:23:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1372. [2025-01-10 00:23:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1129 states have (on average 1.5225863596102747) internal successors, (1719), 1362 states have internal predecessors, (1719), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1731 transitions. [2025-01-10 00:23:20,400 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1731 transitions. Word has length 97 [2025-01-10 00:23:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:20,400 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1731 transitions. [2025-01-10 00:23:20,401 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-01-10 00:23:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1731 transitions. [2025-01-10 00:23:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:23:20,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:20,401 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-01-10 00:23:20,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:23:20,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:20,606 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:20,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash -24278411, now seen corresponding path program 1 times [2025-01-10 00:23:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:20,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391641055] [2025-01-10 00:23:20,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:20,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:23:20,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:23:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391641055] [2025-01-10 00:23:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391641055] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190201937] [2025-01-10 00:23:21,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:21,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:21,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:21,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:21,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:23:21,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:23:21,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:23:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:21,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:21,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 00:23:21,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:21,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:21,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:23:21,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:21,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:23:21,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:21,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 00:23:21,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:21,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:23:21,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:21,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:23:21,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:23:21,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:21,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:23:21,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:23:21,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:21,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:23:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:21,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:21,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1220 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:23:21,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1226) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1225))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1226) .cse1 v_ArrVal_1220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:23:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190201937] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:21,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2025-01-10 00:23:21,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485560147] [2025-01-10 00:23:21,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:21,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:23:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:21,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:23:21,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=308, Unknown=13, NotChecked=74, Total=462 [2025-01-10 00:23:21,773 INFO L87 Difference]: Start difference. First operand 1372 states and 1731 transitions. Second operand has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:23,178 INFO L93 Difference]: Finished difference Result 1374 states and 1735 transitions. [2025-01-10 00:23:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:23:23,179 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2025-01-10 00:23:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:23,181 INFO L225 Difference]: With dead ends: 1374 [2025-01-10 00:23:23,181 INFO L226 Difference]: Without dead ends: 1374 [2025-01-10 00:23:23,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=488, Unknown=15, NotChecked=94, Total=702 [2025-01-10 00:23:23,182 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 697 mSDsluCounter, 2973 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3474 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:23,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 3474 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:23:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-01-10 00:23:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1356. [2025-01-10 00:23:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1115 states have (on average 1.526457399103139) internal successors, (1702), 1348 states have internal predecessors, (1702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1712 transitions. [2025-01-10 00:23:23,193 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1712 transitions. Word has length 97 [2025-01-10 00:23:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1712 transitions. [2025-01-10 00:23:23,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1712 transitions. [2025-01-10 00:23:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:23:23,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:23,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:23,201 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-01-10 00:23:23,398 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,SelfDestructingSolverStorable25 [2025-01-10 00:23:23,398 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 91113801, now seen corresponding path program 1 times [2025-01-10 00:23:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260992223] [2025-01-10 00:23:23,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:23,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:23:23,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:23:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:23,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260992223] [2025-01-10 00:23:23,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260992223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:23,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:23:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855717500] [2025-01-10 00:23:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:23,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:23:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:23,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:23:23,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:23:23,815 INFO L87 Difference]: Start difference. First operand 1356 states and 1712 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-01-10 00:23:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:25,146 INFO L93 Difference]: Finished difference Result 1381 states and 1743 transitions. [2025-01-10 00:23:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:25,147 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-01-10 00:23:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:25,148 INFO L225 Difference]: With dead ends: 1381 [2025-01-10 00:23:25,149 INFO L226 Difference]: Without dead ends: 1381 [2025-01-10 00:23:25,149 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-01-10 00:23:25,149 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 714 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 4877 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:25,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 4877 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:23:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-01-10 00:23:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-01-10 00:23:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1135 states have (on average 1.5198237885462555) internal successors, (1725), 1367 states have internal predecessors, (1725), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1737 transitions. [2025-01-10 00:23:25,158 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1737 transitions. Word has length 99 [2025-01-10 00:23:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1737 transitions. [2025-01-10 00:23:25,158 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-01-10 00:23:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1737 transitions. [2025-01-10 00:23:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 00:23:25,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:25,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 00:23:25,159 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash 91113802, now seen corresponding path program 1 times [2025-01-10 00:23:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:25,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577423976] [2025-01-10 00:23:25,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:25,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 00:23:25,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 00:23:25,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:25,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577423976] [2025-01-10 00:23:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577423976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:23:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765269255] [2025-01-10 00:23:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:23:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:25,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:23:25,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:23:25,628 INFO L87 Difference]: Start difference. First operand 1377 states and 1737 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-01-10 00:23:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:27,159 INFO L93 Difference]: Finished difference Result 1380 states and 1741 transitions. [2025-01-10 00:23:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:23:27,159 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-01-10 00:23:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:27,161 INFO L225 Difference]: With dead ends: 1380 [2025-01-10 00:23:27,162 INFO L226 Difference]: Without dead ends: 1380 [2025-01-10 00:23:27,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:23:27,163 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 730 mSDsluCounter, 2850 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:27,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3352 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:23:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-01-10 00:23:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2025-01-10 00:23:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1135 states have (on average 1.5180616740088106) internal successors, (1723), 1367 states have internal predecessors, (1723), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1735 transitions. [2025-01-10 00:23:27,173 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1735 transitions. Word has length 99 [2025-01-10 00:23:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:27,173 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1735 transitions. [2025-01-10 00:23:27,173 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-01-10 00:23:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1735 transitions. [2025-01-10 00:23:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 00:23:27,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:27,174 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-01-10 00:23:27,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 00:23:27,174 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1723023658, now seen corresponding path program 1 times [2025-01-10 00:23:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280164669] [2025-01-10 00:23:27,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:27,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 00:23:27,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 00:23:27,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:27,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:27,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280164669] [2025-01-10 00:23:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280164669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:27,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822163092] [2025-01-10 00:23:27,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:27,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:27,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:27,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:27,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:23:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 00:23:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 00:23:27,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:27,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:27,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 00:23:27,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:27,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:27,824 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:27,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:23:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:27,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:28,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:28,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:28,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:28,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:28,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:28,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:28,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:28,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:28,292 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1531))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1532)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:32,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1531)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1532)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:32,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822163092] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:32,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:32,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-01-10 00:23:32,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087771348] [2025-01-10 00:23:32,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:32,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:23:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:32,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:23:32,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=573, Unknown=30, NotChecked=102, Total=812 [2025-01-10 00:23:32,392 INFO L87 Difference]: Start difference. First operand 1377 states and 1735 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-01-10 00:23:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:35,287 INFO L93 Difference]: Finished difference Result 1379 states and 1739 transitions. [2025-01-10 00:23:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:23:35,288 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-01-10 00:23:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:35,290 INFO L225 Difference]: With dead ends: 1379 [2025-01-10 00:23:35,290 INFO L226 Difference]: Without dead ends: 1379 [2025-01-10 00:23:35,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=130, Invalid=717, Unknown=31, NotChecked=114, Total=992 [2025-01-10 00:23:35,290 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 687 mSDsluCounter, 7734 mSDsCounter, 0 mSdLazyCounter, 5185 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 8231 SdHoareTripleChecker+Invalid, 5197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:35,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 8231 Invalid, 5197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5185 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-10 00:23:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-01-10 00:23:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2025-01-10 00:23:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1135 states have (on average 1.5162995594713657) internal successors, (1721), 1366 states have internal predecessors, (1721), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1733 transitions. [2025-01-10 00:23:35,304 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1733 transitions. Word has length 100 [2025-01-10 00:23:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:35,305 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1733 transitions. [2025-01-10 00:23:35,305 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-01-10 00:23:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1733 transitions. [2025-01-10 00:23:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 00:23:35,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:35,306 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-01-10 00:23:35,316 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-01-10 00:23:35,506 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,SelfDestructingSolverStorable28 [2025-01-10 00:23:35,506 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:35,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:35,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1723023657, now seen corresponding path program 1 times [2025-01-10 00:23:35,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:35,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428729546] [2025-01-10 00:23:35,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:35,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:35,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 00:23:35,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 00:23:35,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428729546] [2025-01-10 00:23:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428729546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455048591] [2025-01-10 00:23:36,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:36,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:36,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:36,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:36,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:23:36,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 00:23:36,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 00:23:36,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:36,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:36,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:23:36,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:36,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:36,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:23:36,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:36,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:23:36,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-10 00:23:36,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:36,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:36,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:23:36,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:36,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:23:36,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-01-10 00:23:36,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:36,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:23:36,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:23:36,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:36,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:23:36,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:23:36,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:36,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:23:36,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-01-10 00:23:36,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:36,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1701 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:23:36,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1701 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2025-01-10 00:23:36,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1700))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1699) .cse0 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1699) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1700) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-01-10 00:23:36,868 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1699) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1700) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1700))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1699) .cse2 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:23:36,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1707 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1708))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1707) .cse0 v_ArrVal_1699) (select (select (store .cse1 .cse0 v_ArrVal_1700) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1701))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1702 (Array Int Int)) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1699 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1707 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1708))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1700))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1707) .cse3 v_ArrVal_1699) .cse4 v_ArrVal_1701) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1702) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:23:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455048591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:36,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2025-01-10 00:23:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133113161] [2025-01-10 00:23:36,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:23:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:36,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:23:36,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=355, Unknown=5, NotChecked=210, Total=650 [2025-01-10 00:23:36,919 INFO L87 Difference]: Start difference. First operand 1376 states and 1733 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 19 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:38,962 INFO L93 Difference]: Finished difference Result 1378 states and 1737 transitions. [2025-01-10 00:23:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 19 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-01-10 00:23:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:38,965 INFO L225 Difference]: With dead ends: 1378 [2025-01-10 00:23:38,965 INFO L226 Difference]: Without dead ends: 1378 [2025-01-10 00:23:38,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=591, Unknown=5, NotChecked=270, Total=992 [2025-01-10 00:23:38,967 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 696 mSDsluCounter, 3344 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 3844 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:38,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 3844 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 00:23:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-01-10 00:23:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1354. [2025-01-10 00:23:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1115 states have (on average 1.5228699551569507) internal successors, (1698), 1346 states have internal predecessors, (1698), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1708 transitions. [2025-01-10 00:23:38,983 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1708 transitions. Word has length 100 [2025-01-10 00:23:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:38,983 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1708 transitions. [2025-01-10 00:23:38,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 19 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1708 transitions. [2025-01-10 00:23:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:23:38,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:38,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:38,993 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-01-10 00:23:39,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:39,186 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash -47436024, now seen corresponding path program 1 times [2025-01-10 00:23:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610105033] [2025-01-10 00:23:39,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:39,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:23:39,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:23:39,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:39,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610105033] [2025-01-10 00:23:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610105033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:23:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550204291] [2025-01-10 00:23:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:23:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:39,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:23:39,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:23:39,604 INFO L87 Difference]: Start difference. First operand 1354 states and 1708 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-01-10 00:23:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:41,357 INFO L93 Difference]: Finished difference Result 1385 states and 1745 transitions. [2025-01-10 00:23:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:23:41,357 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-01-10 00:23:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:41,359 INFO L225 Difference]: With dead ends: 1385 [2025-01-10 00:23:41,359 INFO L226 Difference]: Without dead ends: 1385 [2025-01-10 00:23:41,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:23:41,360 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 737 mSDsluCounter, 4845 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:41,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 5345 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:23:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2025-01-10 00:23:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1381. [2025-01-10 00:23:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1141 states have (on average 1.5135845749342682) internal successors, (1727), 1371 states have internal predecessors, (1727), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1739 transitions. [2025-01-10 00:23:41,371 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1739 transitions. Word has length 102 [2025-01-10 00:23:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:41,371 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1739 transitions. [2025-01-10 00:23:41,371 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-01-10 00:23:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1739 transitions. [2025-01-10 00:23:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:23:41,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:41,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 00:23:41,372 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:41,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -47436023, now seen corresponding path program 1 times [2025-01-10 00:23:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:41,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550734061] [2025-01-10 00:23:41,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:41,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:23:41,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:23:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:41,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:41,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550734061] [2025-01-10 00:23:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550734061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:41,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:23:41,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930173437] [2025-01-10 00:23:41,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:41,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:23:41,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:41,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:23:41,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:23:41,975 INFO L87 Difference]: Start difference. First operand 1381 states and 1739 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-01-10 00:23:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:43,799 INFO L93 Difference]: Finished difference Result 1384 states and 1743 transitions. [2025-01-10 00:23:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:23:43,799 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-01-10 00:23:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:43,802 INFO L225 Difference]: With dead ends: 1384 [2025-01-10 00:23:43,802 INFO L226 Difference]: Without dead ends: 1384 [2025-01-10 00:23:43,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:23:43,802 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 730 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:43,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3358 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-10 00:23:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-01-10 00:23:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2025-01-10 00:23:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1141 states have (on average 1.511831726555653) internal successors, (1725), 1371 states have internal predecessors, (1725), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1737 transitions. [2025-01-10 00:23:43,816 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1737 transitions. Word has length 102 [2025-01-10 00:23:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:43,816 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1737 transitions. [2025-01-10 00:23:43,816 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-01-10 00:23:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1737 transitions. [2025-01-10 00:23:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 00:23:43,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:43,817 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-01-10 00:23:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 00:23:43,818 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1442991525, now seen corresponding path program 1 times [2025-01-10 00:23:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897055468] [2025-01-10 00:23:43,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:43,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 00:23:43,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 00:23:43,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897055468] [2025-01-10 00:23:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897055468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333121802] [2025-01-10 00:23:44,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:44,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:44,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:44,374 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:44,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:23:44,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 00:23:44,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 00:23:44,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:44,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:44,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 00:23:44,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:44,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:44,686 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:44,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:23:44,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:44,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:23:44,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:44,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:44,990 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:44,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:45,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:45,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:45,088 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:45,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:45,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:45,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:45,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2039) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:23:45,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:23:45,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2038))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:45,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2037))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2038)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:45,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2037 (Array Int Int)) (v_ArrVal_2042 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2042))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2037)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2038)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2039)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333121802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:45,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2025-01-10 00:23:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705901661] [2025-01-10 00:23:45,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:23:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:23:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=635, Unknown=15, NotChecked=280, Total=1056 [2025-01-10 00:23:45,246 INFO L87 Difference]: Start difference. First operand 1381 states and 1737 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-01-10 00:23:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:47,421 INFO L93 Difference]: Finished difference Result 1383 states and 1741 transitions. [2025-01-10 00:23:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:23:47,421 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-01-10 00:23:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:47,423 INFO L225 Difference]: With dead ends: 1383 [2025-01-10 00:23:47,423 INFO L226 Difference]: Without dead ends: 1383 [2025-01-10 00:23:47,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=786, Unknown=15, NotChecked=310, Total=1260 [2025-01-10 00:23:47,424 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 682 mSDsluCounter, 5306 mSDsCounter, 0 mSdLazyCounter, 3645 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 3660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:47,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 5802 Invalid, 3660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3645 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 00:23:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-01-10 00:23:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1380. [2025-01-10 00:23:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1141 states have (on average 1.5100788781770378) internal successors, (1723), 1370 states have internal predecessors, (1723), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1735 transitions. [2025-01-10 00:23:47,432 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1735 transitions. Word has length 103 [2025-01-10 00:23:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:47,433 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1735 transitions. [2025-01-10 00:23:47,433 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-01-10 00:23:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1735 transitions. [2025-01-10 00:23:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 00:23:47,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:47,433 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-01-10 00:23:47,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 00:23:47,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:47,634 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:47,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1442991524, now seen corresponding path program 1 times [2025-01-10 00:23:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654356921] [2025-01-10 00:23:47,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:47,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 00:23:47,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 00:23:47,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:47,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:48,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:48,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654356921] [2025-01-10 00:23:48,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654356921] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:48,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124455708] [2025-01-10 00:23:48,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:48,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:48,495 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:23:48,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:23:48,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 00:23:48,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 00:23:48,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:48,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:48,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 00:23:48,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:48,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:48,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:48,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:23:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:23:48,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:48,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:48,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:48,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:23:48,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:23:49,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:49,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:23:49,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:23:49,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:49,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:23:49,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:23:49,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:49,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:23:49,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:23:49,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-01-10 00:23:49,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-01-10 00:23:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:49,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:49,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:23:49,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2223 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2025-01-10 00:23:49,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2220))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2221) .cse0 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2221) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-01-10 00:23:49,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2221) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2220))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2221) .cse2 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:23:49,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2218))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2220))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2219) .cse0 v_ArrVal_2221) .cse1 v_ArrVal_2223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2218))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2219) .cse5 v_ArrVal_2221) (select (select (store .cse6 .cse5 v_ArrVal_2220) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2223))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-01-10 00:23:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124455708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:49,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2025-01-10 00:23:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256476509] [2025-01-10 00:23:49,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:49,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 00:23:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:49,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 00:23:49,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=698, Unknown=14, NotChecked=290, Total=1122 [2025-01-10 00:23:49,741 INFO L87 Difference]: Start difference. First operand 1380 states and 1735 transitions. Second operand has 25 states, 22 states have (on average 7.5) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:53,280 INFO L93 Difference]: Finished difference Result 1382 states and 1739 transitions. [2025-01-10 00:23:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.5) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-01-10 00:23:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:53,284 INFO L225 Difference]: With dead ends: 1382 [2025-01-10 00:23:53,284 INFO L226 Difference]: Without dead ends: 1382 [2025-01-10 00:23:53,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=1070, Unknown=14, NotChecked=360, Total=1640 [2025-01-10 00:23:53,285 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 694 mSDsluCounter, 6245 mSDsCounter, 0 mSdLazyCounter, 5872 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 6741 SdHoareTripleChecker+Invalid, 5890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:53,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 6741 Invalid, 5890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5872 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-10 00:23:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-01-10 00:23:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1352. [2025-01-10 00:23:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1115 states have (on average 1.5192825112107624) internal successors, (1694), 1344 states have internal predecessors, (1694), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:23:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1704 transitions. [2025-01-10 00:23:53,293 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1704 transitions. Word has length 103 [2025-01-10 00:23:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:53,294 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1704 transitions. [2025-01-10 00:23:53,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.5) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1704 transitions. [2025-01-10 00:23:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 00:23:53,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:53,294 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-01-10 00:23:53,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:23:53,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:53,499 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 522448010, now seen corresponding path program 1 times [2025-01-10 00:23:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507121147] [2025-01-10 00:23:53,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:53,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 00:23:53,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 00:23:53,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:53,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:54,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507121147] [2025-01-10 00:23:54,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507121147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:54,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:54,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:23:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905630808] [2025-01-10 00:23:54,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:54,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:23:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:54,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:23:54,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:23:54,038 INFO L87 Difference]: Start difference. First operand 1352 states and 1704 transitions. Second operand has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 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-01-10 00:23:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:55,522 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2025-01-10 00:23:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:23:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 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-01-10 00:23:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:55,524 INFO L225 Difference]: With dead ends: 1391 [2025-01-10 00:23:55,525 INFO L226 Difference]: Without dead ends: 1391 [2025-01-10 00:23:55,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:23:55,525 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 716 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:55,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3895 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:23:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-01-10 00:23:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1387. [2025-01-10 00:23:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1149 states have (on average 1.5065274151436032) internal successors, (1731), 1377 states have internal predecessors, (1731), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1743 transitions. [2025-01-10 00:23:55,534 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1743 transitions. Word has length 106 [2025-01-10 00:23:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:55,535 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1743 transitions. [2025-01-10 00:23:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 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-01-10 00:23:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1743 transitions. [2025-01-10 00:23:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 00:23:55,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:55,535 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-01-10 00:23:55,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 00:23:55,535 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 522448011, now seen corresponding path program 1 times [2025-01-10 00:23:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141974933] [2025-01-10 00:23:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 00:23:55,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 00:23:55,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:55,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:56,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141974933] [2025-01-10 00:23:56,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141974933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:56,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-10 00:23:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061615769] [2025-01-10 00:23:56,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:56,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:23:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:56,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:23:56,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:23:56,420 INFO L87 Difference]: Start difference. First operand 1387 states and 1743 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-01-10 00:23:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:58,936 INFO L93 Difference]: Finished difference Result 1390 states and 1747 transitions. [2025-01-10 00:23:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:23:58,937 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-01-10 00:23:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:58,938 INFO L225 Difference]: With dead ends: 1390 [2025-01-10 00:23:58,938 INFO L226 Difference]: Without dead ends: 1390 [2025-01-10 00:23:58,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-01-10 00:23:58,939 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 731 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4658 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:58,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4658 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:23:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2025-01-10 00:23:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1387. [2025-01-10 00:23:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1149 states have (on average 1.504786771105309) internal successors, (1729), 1377 states have internal predecessors, (1729), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:23:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1741 transitions. [2025-01-10 00:23:58,948 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1741 transitions. Word has length 106 [2025-01-10 00:23:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:58,949 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1741 transitions. [2025-01-10 00:23:58,949 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-01-10 00:23:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1741 transitions. [2025-01-10 00:23:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 00:23:58,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:58,949 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-01-10 00:23:58,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 00:23:58,949 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:23:58,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash 906858077, now seen corresponding path program 1 times [2025-01-10 00:23:58,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:58,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539725398] [2025-01-10 00:23:58,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:58,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 00:23:58,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 00:23:58,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:58,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539725398] [2025-01-10 00:23:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539725398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137142605] [2025-01-10 00:23:59,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:59,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:59,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:59,516 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-01-10 00:23:59,518 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-01-10 00:23:59,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 00:23:59,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 00:23:59,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:59,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 00:23:59,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:59,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:23:59,859 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:59,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:23:59,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:23:59,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:24:00,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:00,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:24:00,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:00,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:24:00,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:00,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:24:00,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:00,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:24:00,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:00,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:24:00,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:24:00,310 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-10 00:24:00,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-10 00:24:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:00,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:24:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137142605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:00,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:24:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2025-01-10 00:24:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884478863] [2025-01-10 00:24:00,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:24:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:24:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:00,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:24:00,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1087, Unknown=56, NotChecked=0, Total=1332 [2025-01-10 00:24:00,866 INFO L87 Difference]: Start difference. First operand 1387 states and 1741 transitions. Second operand has 26 states, 23 states have (on average 7.521739130434782) internal successors, (173), 26 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-01-10 00:24:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:02,723 INFO L93 Difference]: Finished difference Result 1389 states and 1745 transitions. [2025-01-10 00:24:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:24:02,723 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.521739130434782) internal successors, (173), 26 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-01-10 00:24:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:02,729 INFO L225 Difference]: With dead ends: 1389 [2025-01-10 00:24:02,729 INFO L226 Difference]: Without dead ends: 1389 [2025-01-10 00:24:02,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=1147, Unknown=56, NotChecked=0, Total=1406 [2025-01-10 00:24:02,730 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 675 mSDsluCounter, 5318 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 5816 SdHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:02,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 5816 Invalid, 3727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:24:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2025-01-10 00:24:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2025-01-10 00:24:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1149 states have (on average 1.5030461270670148) internal successors, (1727), 1376 states have internal predecessors, (1727), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 00:24:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1739 transitions. [2025-01-10 00:24:02,756 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1739 transitions. Word has length 107 [2025-01-10 00:24:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:02,757 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1739 transitions. [2025-01-10 00:24:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.521739130434782) internal successors, (173), 26 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-01-10 00:24:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1739 transitions. [2025-01-10 00:24:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 00:24:02,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:02,759 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-01-10 00:24:02,766 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-01-10 00:24:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:02,960 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:24:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 906858078, now seen corresponding path program 1 times [2025-01-10 00:24:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487679119] [2025-01-10 00:24:02,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:02,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 00:24:03,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 00:24:03,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:03,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487679119] [2025-01-10 00:24:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487679119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868261974] [2025-01-10 00:24:03,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:03,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:03,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:03,791 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-01-10 00:24:03,791 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-01-10 00:24:03,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 00:24:04,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 00:24:04,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:04,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:04,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-10 00:24:04,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:24:04,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:24:04,119 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:24:04,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:24:04,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:24:04,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:24:04,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:04,231 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 51 treesize of output 48 [2025-01-10 00:24:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:24:04,334 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 00:24:04,335 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 69 treesize of output 41 [2025-01-10 00:24:04,343 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 39 treesize of output 20 [2025-01-10 00:24:04,506 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-10 00:24:04,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2025-01-10 00:24:04,510 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 39 treesize of output 20 [2025-01-10 00:24:04,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2025-01-10 00:24:04,707 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-10 00:24:04,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:24:04,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:04,779 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 81 treesize of output 74 [2025-01-10 00:24:04,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-10 00:24:04,840 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 50 treesize of output 26 [2025-01-10 00:24:04,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-01-10 00:24:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:24:04,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2025-01-10 00:24:04,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:24:04,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:24:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:04,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:24:05,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:24:05,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2025-01-10 00:24:05,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_18 Int)) (or (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_prenex_17 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 3) (select (store |c_#length| v_prenex_18 v_ArrVal_2796) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_18))) (forall ((v_ArrVal_2795 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_2795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))))) is different from false [2025-01-10 00:24:05,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int))) (< 0 (+ 1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2792) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_prenex_18 Int) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2793))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (= v_prenex_18 .cse1) (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_prenex_17 (Array Int Int))) (< (+ 3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2792) .cse1 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| v_prenex_18 v_ArrVal_2796) (select (select (store .cse2 .cse1 v_ArrVal_2794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2025-01-10 00:24:05,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2792) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((v_prenex_18 Int) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2793))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= .cse2 v_prenex_18) (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_prenex_17 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2792) .cse2 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 3) (select (store |c_#length| v_prenex_18 v_ArrVal_2796) (select (select (store .cse3 .cse2 v_ArrVal_2794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2025-01-10 00:24:05,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_18 Int) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2790))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_2793))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= .cse0 v_prenex_18) (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int) (v_prenex_17 (Array Int Int))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2791) .cse1 v_ArrVal_2792) .cse0 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 3) (select (store |c_#length| v_prenex_18 v_ArrVal_2796) (select (select (store .cse3 .cse0 v_ArrVal_2794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (forall ((v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2790))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2791) .cse5 v_ArrVal_2792) (select (select (store .cse6 .cse5 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2795))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))) is different from false [2025-01-10 00:24:05,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:24:05,700 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 985 treesize of output 989 [2025-01-10 00:24:05,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2790))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2793)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store .cse4 .cse5 v_prenex_23))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_prenex_19) .cse5 v_prenex_22) .cse6 v_prenex_21) (select (select (store .cse7 .cse6 v_prenex_20) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2795))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem56#1.base| (select (select (let ((.cse8 (let ((.cse9 (store .cse4 .cse5 v_ArrVal_2790))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2793)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (forall ((v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (v_prenex_17 (Array Int Int))) (< (select (select (let ((.cse11 (store .cse4 .cse5 v_ArrVal_2790))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2788) .cse5 v_ArrVal_2791) .cse10 v_ArrVal_2792) (select (select (store .cse11 .cse10 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_17))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 17)))))) is different from false [2025-01-10 00:24:15,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_25| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2802))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_25| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2801))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_25|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store .cse6 .cse3 v_prenex_23))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store .cse0 .cse2 v_prenex_19) .cse3 v_prenex_22) .cse4 v_prenex_21) (select (select (store .cse5 .cse4 v_prenex_20) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2795))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_25| Int)) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_25| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2801))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_25|) |c_ULTIMATE.start_main_~user~0#1.base|)))))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2790)))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2793)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse8 (select (select (store .cse9 .cse8 v_ArrVal_2794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) (forall ((v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_25| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2802))) (or (forall ((v_ArrVal_2788 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2791 (Array Int Int)) (v_ArrVal_2790 (Array Int Int)) (v_prenex_17 (Array Int Int))) (< (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2801))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse20 .cse15 (store (select .cse20 .cse15) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_25|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_2790))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store .cse14 .cse15 v_ArrVal_2788) .cse16 v_ArrVal_2791) .cse17 v_ArrVal_2792) (select (select (store .cse18 .cse17 v_ArrVal_2793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_17))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 17 |v_ULTIMATE.start_main_#t~mem56#1.offset_25|))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_25| (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (forall ((v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_25| Int)) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_25| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2802) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (forall ((v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2790 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2801))) (let ((.cse21 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse21 (select (select (let ((.cse22 (let ((.cse23 (let ((.cse24 (store .cse25 .cse21 (store (select .cse25 .cse21) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_25|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2790)))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2793)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:24:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868261974] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:15,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:24:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2025-01-10 00:24:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40507836] [2025-01-10 00:24:15,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:24:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 00:24:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:15,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 00:24:15,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1207, Unknown=29, NotChecked=462, Total=1892 [2025-01-10 00:24:15,449 INFO L87 Difference]: Start difference. First operand 1386 states and 1739 transitions. Second operand has 32 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 32 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:24:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:23,018 INFO L93 Difference]: Finished difference Result 1388 states and 1743 transitions. [2025-01-10 00:24:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 00:24:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 32 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2025-01-10 00:24:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:23,020 INFO L225 Difference]: With dead ends: 1388 [2025-01-10 00:24:23,021 INFO L226 Difference]: Without dead ends: 1388 [2025-01-10 00:24:23,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=359, Invalid=1988, Unknown=29, NotChecked=594, Total=2970 [2025-01-10 00:24:23,021 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 689 mSDsluCounter, 6018 mSDsCounter, 0 mSdLazyCounter, 5308 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 6514 SdHoareTripleChecker+Invalid, 5327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:23,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 6514 Invalid, 5327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5308 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-01-10 00:24:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-01-10 00:24:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1350. [2025-01-10 00:24:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1115 states have (on average 1.515695067264574) internal successors, (1690), 1342 states have internal predecessors, (1690), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:24:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1700 transitions. [2025-01-10 00:24:23,037 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1700 transitions. Word has length 107 [2025-01-10 00:24:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:23,037 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1700 transitions. [2025-01-10 00:24:23,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 32 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:24:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1700 transitions. [2025-01-10 00:24:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 00:24:23,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:23,040 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-01-10 00:24:23,049 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-01-10 00:24:23,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-10 00:24:23,244 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:24:23,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash -712150442, now seen corresponding path program 1 times [2025-01-10 00:24:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838439921] [2025-01-10 00:24:23,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:23,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 00:24:23,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 00:24:23,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:23,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838439921] [2025-01-10 00:24:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838439921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:23,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:24:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127505544] [2025-01-10 00:24:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:23,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:24:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:23,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:24:23,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:24:23,567 INFO L87 Difference]: Start difference. First operand 1350 states and 1700 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 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-01-10 00:24:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:25,095 INFO L93 Difference]: Finished difference Result 1349 states and 1698 transitions. [2025-01-10 00:24:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:24:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 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-01-10 00:24:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:25,097 INFO L225 Difference]: With dead ends: 1349 [2025-01-10 00:24:25,097 INFO L226 Difference]: Without dead ends: 1349 [2025-01-10 00:24:25,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:24:25,097 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 2 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:25,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3555 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-10 00:24:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-01-10 00:24:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2025-01-10 00:24:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1115 states have (on average 1.5139013452914798) internal successors, (1688), 1341 states have internal predecessors, (1688), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:24:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1698 transitions. [2025-01-10 00:24:25,105 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1698 transitions. Word has length 109 [2025-01-10 00:24:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:25,106 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 1698 transitions. [2025-01-10 00:24:25,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 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-01-10 00:24:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1698 transitions. [2025-01-10 00:24:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 00:24:25,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:25,106 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-01-10 00:24:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-10 00:24:25,106 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2025-01-10 00:24:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -712150441, now seen corresponding path program 1 times [2025-01-10 00:24:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913012960] [2025-01-10 00:24:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 00:24:25,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 00:24:25,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:25,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat