./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-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_test1-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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:22:31,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:22:31,535 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:31,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:22:31,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:22:31,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:22:31,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:22:31,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:22:31,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:22:31,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:22:31,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:22:31,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:22:31,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:22:31,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:22:31,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:22:31,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:31,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:31,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:22:31,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:22:31,560 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-01-10 00:22:31,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:22:31,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:22:31,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:22:31,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:22:31,782 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:22:31,783 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_test1-1.i [2025-01-10 00:22:32,940 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/253d942ac/699423809b5a43079a0ef4c2a698895b/FLAGe819acba0 [2025-01-10 00:22:33,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:22:33,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2025-01-10 00:22:33,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/253d942ac/699423809b5a43079a0ef4c2a698895b/FLAGe819acba0 [2025-01-10 00:22:33,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/253d942ac/699423809b5a43079a0ef4c2a698895b [2025-01-10 00:22:33,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:22:33,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:22:33,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:22:33,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:22:33,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:22:33,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:22:33" (1/1) ... [2025-01-10 00:22:33,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c195f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:33, skipping insertion in model container [2025-01-10 00:22:33,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:22:33" (1/1) ... [2025-01-10 00:22:33,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:22:33,541 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:33,564 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:33,566 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:33,570 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:33,575 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:33,583 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:33,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:22:33,598 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:22:33,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:22:33,703 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:22:33,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:33 WrapperNode [2025-01-10 00:22:33,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:22:33,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:22:33,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:22:33,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:22:33,709 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:33" (1/1) ... [2025-01-10 00:22:33,722 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:33" (1/1) ... [2025-01-10 00:22:33,747 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-01-10 00:22:33,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:22:33,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:22:33,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:22:33,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:22:33,759 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:33" (1/1) ... [2025-01-10 00:22:33,760 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:33" (1/1) ... [2025-01-10 00:22:33,766 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:33" (1/1) ... [2025-01-10 00:22:33,817 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [156, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 42 writes are split as follows [42, 0]. [2025-01-10 00:22:33,818 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:33" (1/1) ... [2025-01-10 00:22:33,818 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:33" (1/1) ... [2025-01-10 00:22:33,846 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:33" (1/1) ... [2025-01-10 00:22:33,847 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:33" (1/1) ... [2025-01-10 00:22:33,855 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:33" (1/1) ... [2025-01-10 00:22:33,859 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:33" (1/1) ... [2025-01-10 00:22:33,866 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:33" (1/1) ... [2025-01-10 00:22:33,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:22:33,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:22:33,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:22:33,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:22:33,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:33" (1/1) ... [2025-01-10 00:22:33,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:22:33,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:33,899 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:33,902 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:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:22:33,920 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:22:33,920 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:22:33,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:22:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:22:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:22:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:22:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:22:33,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:22:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:22:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:22:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:22:33,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:22:34,061 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:22:34,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:22:34,065 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:34,093 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:22:35,173 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2025-01-10 00:22:35,173 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:22:35,194 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:22:35,194 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 00:22:35,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:22:35 BoogieIcfgContainer [2025-01-10 00:22:35,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:22:35,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:22:35,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:22:35,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:22:35,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:22:33" (1/3) ... [2025-01-10 00:22:35,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5a230d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:22:35, skipping insertion in model container [2025-01-10 00:22:35,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:22:33" (2/3) ... [2025-01-10 00:22:35,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5a230d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:22:35, skipping insertion in model container [2025-01-10 00:22:35,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:22:35" (3/3) ... [2025-01-10 00:22:35,206 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-1.i [2025-01-10 00:22:35,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:22:35,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test1-1.i that has 3 procedures, 738 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2025-01-10 00:22:35,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:22:35,265 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;@cab4f30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:22:35,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-01-10 00:22:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 733 states, 411 states have (on average 2.0632603406326036) internal successors, (848), 728 states have internal predecessors, (848), 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:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:22:35,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:35,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:22:35,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:35,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash 45872282, now seen corresponding path program 1 times [2025-01-10 00:22:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:35,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031996360] [2025-01-10 00:22:35,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:35,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:22:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:22:35,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:35,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:35,378 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:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:35,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031996360] [2025-01-10 00:22:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031996360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:35,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449715952] [2025-01-10 00:22:35,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:35,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:22:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:35,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:22:35,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:22:35,403 INFO L87 Difference]: Start difference. First operand has 733 states, 411 states have (on average 2.0632603406326036) internal successors, (848), 728 states have internal predecessors, (848), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:35,456 INFO L93 Difference]: Finished difference Result 723 states and 811 transitions. [2025-01-10 00:22:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:22:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:22:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:35,474 INFO L225 Difference]: With dead ends: 723 [2025-01-10 00:22:35,476 INFO L226 Difference]: Without dead ends: 721 [2025-01-10 00:22:35,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:22:35,480 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:35,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-01-10 00:22:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2025-01-10 00:22:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 405 states have (on average 1.982716049382716) internal successors, (803), 716 states have internal predecessors, (803), 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:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 809 transitions. [2025-01-10 00:22:35,544 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 809 transitions. Word has length 5 [2025-01-10 00:22:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:35,545 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 809 transitions. [2025-01-10 00:22:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 809 transitions. [2025-01-10 00:22:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:22:35,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:35,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:22:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:22:35,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash 45872344, now seen corresponding path program 1 times [2025-01-10 00:22:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877527858] [2025-01-10 00:22:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:35,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:22:35,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:22:35,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:35,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:35,635 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:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877527858] [2025-01-10 00:22:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877527858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585478676] [2025-01-10 00:22:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:35,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:35,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:35,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:35,637 INFO L87 Difference]: Start difference. First operand 721 states and 809 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:36,058 INFO L93 Difference]: Finished difference Result 673 states and 762 transitions. [2025-01-10 00:22:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:36,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:22:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:36,061 INFO L225 Difference]: With dead ends: 673 [2025-01-10 00:22:36,061 INFO L226 Difference]: Without dead ends: 673 [2025-01-10 00:22:36,061 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:36,062 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 675 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:36,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 459 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-10 00:22:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 672. [2025-01-10 00:22:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 405 states have (on average 1.8617283950617285) internal successors, (754), 667 states have internal predecessors, (754), 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:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 760 transitions. [2025-01-10 00:22:36,084 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 760 transitions. Word has length 5 [2025-01-10 00:22:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:36,085 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 760 transitions. [2025-01-10 00:22:36,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 760 transitions. [2025-01-10 00:22:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:22:36,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:36,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:22:36,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:22:36,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:36,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash 45872345, now seen corresponding path program 1 times [2025-01-10 00:22:36,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:36,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113856388] [2025-01-10 00:22:36,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:36,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:36,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:22:36,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:22:36,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:36,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:36,166 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:36,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113856388] [2025-01-10 00:22:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113856388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:36,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:36,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:22:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225114205] [2025-01-10 00:22:36,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:36,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:36,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:36,167 INFO L87 Difference]: Start difference. First operand 672 states and 760 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:36,540 INFO L93 Difference]: Finished difference Result 748 states and 842 transitions. [2025-01-10 00:22:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:36,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:22:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:36,543 INFO L225 Difference]: With dead ends: 748 [2025-01-10 00:22:36,543 INFO L226 Difference]: Without dead ends: 748 [2025-01-10 00:22:36,543 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:36,543 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 414 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:36,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 820 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-01-10 00:22:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 701. [2025-01-10 00:22:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 445 states have (on average 1.847191011235955) internal successors, (822), 696 states have internal predecessors, (822), 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:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 828 transitions. [2025-01-10 00:22:36,558 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 828 transitions. Word has length 5 [2025-01-10 00:22:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:36,558 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 828 transitions. [2025-01-10 00:22:36,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 828 transitions. [2025-01-10 00:22:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:22:36,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:36,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:22:36,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:22:36,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:36,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 47114554, now seen corresponding path program 1 times [2025-01-10 00:22:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293419301] [2025-01-10 00:22:36,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:36,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:22:36,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:22:36,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:36,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:36,592 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:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293419301] [2025-01-10 00:22:36,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293419301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:36,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:36,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:36,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266036260] [2025-01-10 00:22:36,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:36,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:36,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:36,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:36,594 INFO L87 Difference]: Start difference. First operand 701 states and 828 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:36,618 INFO L93 Difference]: Finished difference Result 1380 states and 1633 transitions. [2025-01-10 00:22:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:36,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 00:22:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:36,622 INFO L225 Difference]: With dead ends: 1380 [2025-01-10 00:22:36,622 INFO L226 Difference]: Without dead ends: 1380 [2025-01-10 00:22:36,622 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:22:36,623 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 719 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:36,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1717 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-01-10 00:22:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 702. [2025-01-10 00:22:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 446 states have (on average 1.845291479820628) internal successors, (823), 697 states have internal predecessors, (823), 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:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 829 transitions. [2025-01-10 00:22:36,648 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 829 transitions. Word has length 5 [2025-01-10 00:22:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:36,649 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 829 transitions. [2025-01-10 00:22:36,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 829 transitions. [2025-01-10 00:22:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:22:36,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:36,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:36,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:22:36,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1756085438, now seen corresponding path program 1 times [2025-01-10 00:22:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913960231] [2025-01-10 00:22:36,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:36,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:36,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:22:36,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:22:36,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:36,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:36,733 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:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913960231] [2025-01-10 00:22:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913960231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31297369] [2025-01-10 00:22:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:36,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:36,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:36,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:36,736 INFO L87 Difference]: Start difference. First operand 702 states and 829 transitions. Second operand has 4 states, 3 states have (on average 5.0) 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:22:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:37,159 INFO L93 Difference]: Finished difference Result 728 states and 882 transitions. [2025-01-10 00:22:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) 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:22:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:37,162 INFO L225 Difference]: With dead ends: 728 [2025-01-10 00:22:37,162 INFO L226 Difference]: Without dead ends: 728 [2025-01-10 00:22:37,162 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:22:37,163 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 938 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:37,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 722 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-01-10 00:22:37,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 679. [2025-01-10 00:22:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 446 states have (on average 1.7937219730941705) internal successors, (800), 674 states have internal predecessors, (800), 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:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 806 transitions. [2025-01-10 00:22:37,179 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 806 transitions. Word has length 15 [2025-01-10 00:22:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:37,179 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 806 transitions. [2025-01-10 00:22:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) 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:22:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 806 transitions. [2025-01-10 00:22:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:22:37,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:37,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:37,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:22:37,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:37,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1756085437, now seen corresponding path program 1 times [2025-01-10 00:22:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:37,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371976422] [2025-01-10 00:22:37,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:37,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:22:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:22:37,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:37,261 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:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371976422] [2025-01-10 00:22:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371976422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673532825] [2025-01-10 00:22:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:37,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:37,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:37,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:37,264 INFO L87 Difference]: Start difference. First operand 679 states and 806 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:22:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:37,290 INFO L93 Difference]: Finished difference Result 604 states and 703 transitions. [2025-01-10 00:22:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:22:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:37,292 INFO L225 Difference]: With dead ends: 604 [2025-01-10 00:22:37,292 INFO L226 Difference]: Without dead ends: 604 [2025-01-10 00:22:37,292 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:22:37,293 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 60 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1171 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:22:37,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1171 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-01-10 00:22:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-01-10 00:22:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 383 states have (on average 1.8198433420365536) internal successors, (697), 599 states have internal predecessors, (697), 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:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 703 transitions. [2025-01-10 00:22:37,301 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 703 transitions. Word has length 15 [2025-01-10 00:22:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 703 transitions. [2025-01-10 00:22:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:22:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 703 transitions. [2025-01-10 00:22:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 00:22:37,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:37,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:22:37,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:37,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1396141845, now seen corresponding path program 1 times [2025-01-10 00:22:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469384384] [2025-01-10 00:22:37,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:22:37,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:22:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:37,349 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:37,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:37,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469384384] [2025-01-10 00:22:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469384384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:37,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:37,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467096315] [2025-01-10 00:22:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:37,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:37,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:37,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:37,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:37,352 INFO L87 Difference]: Start difference. First operand 604 states and 703 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:37,397 INFO L93 Difference]: Finished difference Result 586 states and 678 transitions. [2025-01-10 00:22:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-01-10 00:22:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:37,399 INFO L225 Difference]: With dead ends: 586 [2025-01-10 00:22:37,399 INFO L226 Difference]: Without dead ends: 586 [2025-01-10 00:22:37,399 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:22:37,400 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 41 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1703 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:22:37,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1703 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-10 00:22:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2025-01-10 00:22:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 369 states have (on average 1.8130081300813008) internal successors, (669), 578 states have internal predecessors, (669), 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:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 675 transitions. [2025-01-10 00:22:37,408 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 675 transitions. Word has length 16 [2025-01-10 00:22:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:37,409 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 675 transitions. [2025-01-10 00:22:37,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 675 transitions. [2025-01-10 00:22:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:22:37,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:37,409 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] [2025-01-10 00:22:37,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:22:37,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 287821763, now seen corresponding path program 1 times [2025-01-10 00:22:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810683889] [2025-01-10 00:22:37,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:37,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:22:37,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:22:37,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:37,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:37,572 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:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810683889] [2025-01-10 00:22:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810683889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:37,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976207347] [2025-01-10 00:22:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:37,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:37,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:37,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:37,573 INFO L87 Difference]: Start difference. First operand 583 states and 675 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:37,976 INFO L93 Difference]: Finished difference Result 675 states and 761 transitions. [2025-01-10 00:22:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:22:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2025-01-10 00:22:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:37,979 INFO L225 Difference]: With dead ends: 675 [2025-01-10 00:22:37,979 INFO L226 Difference]: Without dead ends: 675 [2025-01-10 00:22:37,979 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:22:37,979 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 415 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:37,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1001 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-01-10 00:22:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 579. [2025-01-10 00:22:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 369 states have (on average 1.8021680216802167) internal successors, (665), 574 states have internal predecessors, (665), 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:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 671 transitions. [2025-01-10 00:22:37,989 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 671 transitions. Word has length 30 [2025-01-10 00:22:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:37,989 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 671 transitions. [2025-01-10 00:22:37,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 671 transitions. [2025-01-10 00:22:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 00:22:37,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:37,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:37,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:22:37,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1483946023, now seen corresponding path program 1 times [2025-01-10 00:22:37,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351363725] [2025-01-10 00:22:37,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:38,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 00:22:38,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 00:22:38,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:38,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:38,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:38,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351363725] [2025-01-10 00:22:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351363725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:38,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387367662] [2025-01-10 00:22:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:22:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:38,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:22:38,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:22:38,085 INFO L87 Difference]: Start difference. First operand 579 states and 671 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:38,118 INFO L93 Difference]: Finished difference Result 579 states and 667 transitions. [2025-01-10 00:22:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:22:38,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-01-10 00:22:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:38,120 INFO L225 Difference]: With dead ends: 579 [2025-01-10 00:22:38,120 INFO L226 Difference]: Without dead ends: 579 [2025-01-10 00:22:38,120 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:22:38,122 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 21 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1685 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:22:38,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1685 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-10 00:22:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2025-01-10 00:22:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 369 states have (on average 1.7913279132791329) internal successors, (661), 574 states have internal predecessors, (661), 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:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 667 transitions. [2025-01-10 00:22:38,130 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 667 transitions. Word has length 64 [2025-01-10 00:22:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 667 transitions. [2025-01-10 00:22:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 667 transitions. [2025-01-10 00:22:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 00:22:38,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:38,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:22:38,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 669927717, now seen corresponding path program 1 times [2025-01-10 00:22:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749344083] [2025-01-10 00:22:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:38,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 00:22:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 00:22:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:38,244 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:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749344083] [2025-01-10 00:22:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749344083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:38,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:38,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:22:38,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848501431] [2025-01-10 00:22:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:22:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:38,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:22:38,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:22:38,246 INFO L87 Difference]: Start difference. First operand 579 states and 667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:38,271 INFO L93 Difference]: Finished difference Result 674 states and 789 transitions. [2025-01-10 00:22:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:22:38,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-10 00:22:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:38,273 INFO L225 Difference]: With dead ends: 674 [2025-01-10 00:22:38,273 INFO L226 Difference]: Without dead ends: 674 [2025-01-10 00:22:38,273 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:22:38,274 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 54 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:38,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1144 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:22:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-10 00:22:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-01-10 00:22:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 464 states have (on average 1.6875) internal successors, (783), 669 states have internal predecessors, (783), 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:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 789 transitions. [2025-01-10 00:22:38,283 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 789 transitions. Word has length 72 [2025-01-10 00:22:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:38,284 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 789 transitions. [2025-01-10 00:22:38,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:22:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 789 transitions. [2025-01-10 00:22:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 00:22:38,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:38,287 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:22:38,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:22:38,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:38,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1005465090, now seen corresponding path program 1 times [2025-01-10 00:22:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843274548] [2025-01-10 00:22:38,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:38,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 00:22:38,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 00:22:38,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:38,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:38,647 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:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843274548] [2025-01-10 00:22:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843274548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:22:38,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044244047] [2025-01-10 00:22:38,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:38,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:22:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:38,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:22:38,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:22:38,649 INFO L87 Difference]: Start difference. First operand 674 states and 789 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 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:22:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:39,088 INFO L93 Difference]: Finished difference Result 636 states and 751 transitions. [2025-01-10 00:22:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:22:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 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:22:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:39,091 INFO L225 Difference]: With dead ends: 636 [2025-01-10 00:22:39,091 INFO L226 Difference]: Without dead ends: 636 [2025-01-10 00:22:39,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:22:39,092 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 913 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:39,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 460 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-10 00:22:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 596. [2025-01-10 00:22:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 424 states have (on average 1.570754716981132) internal successors, (666), 591 states have internal predecessors, (666), 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:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2025-01-10 00:22:39,101 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 75 [2025-01-10 00:22:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:39,101 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2025-01-10 00:22:39,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 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:22:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2025-01-10 00:22:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 00:22:39,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:39,103 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] [2025-01-10 00:22:39,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:22:39,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:39,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1803086024, now seen corresponding path program 1 times [2025-01-10 00:22:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953226392] [2025-01-10 00:22:39,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:39,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 00:22:39,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 00:22:39,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:39,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:39,286 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:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953226392] [2025-01-10 00:22:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953226392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:39,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:39,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983286456] [2025-01-10 00:22:39,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:39,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:22:39,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:39,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:22:39,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:22:39,288 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:39,654 INFO L93 Difference]: Finished difference Result 595 states and 671 transitions. [2025-01-10 00:22:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:22:39,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-01-10 00:22:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:39,656 INFO L225 Difference]: With dead ends: 595 [2025-01-10 00:22:39,656 INFO L226 Difference]: Without dead ends: 595 [2025-01-10 00:22:39,656 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:22:39,656 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 2 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:39,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1490 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:22:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-10 00:22:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-01-10 00:22:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 424 states have (on average 1.5683962264150944) internal successors, (665), 590 states have internal predecessors, (665), 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:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 671 transitions. [2025-01-10 00:22:39,665 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 671 transitions. Word has length 80 [2025-01-10 00:22:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:39,665 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 671 transitions. [2025-01-10 00:22:39,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 671 transitions. [2025-01-10 00:22:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 00:22:39,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:39,666 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] [2025-01-10 00:22:39,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:22:39,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:39,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1803086023, now seen corresponding path program 1 times [2025-01-10 00:22:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366234994] [2025-01-10 00:22:39,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:39,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 00:22:39,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 00:22:39,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:39,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:39,965 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:39,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:39,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366234994] [2025-01-10 00:22:39,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366234994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:39,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:22:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101023293] [2025-01-10 00:22:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:39,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:22:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:39,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:22:39,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:22:39,968 INFO L87 Difference]: Start difference. First operand 595 states and 671 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:40,381 INFO L93 Difference]: Finished difference Result 594 states and 670 transitions. [2025-01-10 00:22:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:22:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-01-10 00:22:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:40,384 INFO L225 Difference]: With dead ends: 594 [2025-01-10 00:22:40,385 INFO L226 Difference]: Without dead ends: 594 [2025-01-10 00:22:40,385 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:22:40,385 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:40,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1499 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-01-10 00:22:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-01-10 00:22:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 423 states have (on average 1.5697399527186762) internal successors, (664), 589 states have internal predecessors, (664), 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:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2025-01-10 00:22:40,393 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 80 [2025-01-10 00:22:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:40,393 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2025-01-10 00:22:40,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2025-01-10 00:22:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:22:40,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:40,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:40,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:22:40,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:40,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1589820895, now seen corresponding path program 1 times [2025-01-10 00:22:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191106434] [2025-01-10 00:22:40,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:22:40,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:22:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:40,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:40,568 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:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191106434] [2025-01-10 00:22:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191106434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:40,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:22:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253514309] [2025-01-10 00:22:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:40,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:22:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:40,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:22:40,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:22:40,571 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:41,070 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2025-01-10 00:22:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:22:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-01-10 00:22:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:41,073 INFO L225 Difference]: With dead ends: 606 [2025-01-10 00:22:41,074 INFO L226 Difference]: Without dead ends: 606 [2025-01-10 00:22:41,074 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:22:41,074 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 6 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:41,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2333 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:22:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-10 00:22:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 600. [2025-01-10 00:22:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 428 states have (on average 1.5677570093457944) internal successors, (671), 594 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 00:22:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 680 transitions. [2025-01-10 00:22:41,081 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 680 transitions. Word has length 88 [2025-01-10 00:22:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 680 transitions. [2025-01-10 00:22:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 680 transitions. [2025-01-10 00:22:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:22:41,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:41,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:41,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:22:41,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:41,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1589820896, now seen corresponding path program 1 times [2025-01-10 00:22:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747378544] [2025-01-10 00:22:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:41,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:22:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:22:41,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:41,404 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:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747378544] [2025-01-10 00:22:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747378544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:22:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838149407] [2025-01-10 00:22:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:41,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:22:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:41,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:22:41,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:22:41,406 INFO L87 Difference]: Start difference. First operand 600 states and 680 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:41,878 INFO L93 Difference]: Finished difference Result 600 states and 679 transitions. [2025-01-10 00:22:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:22:41,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-01-10 00:22:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:41,880 INFO L225 Difference]: With dead ends: 600 [2025-01-10 00:22:41,881 INFO L226 Difference]: Without dead ends: 600 [2025-01-10 00:22:41,881 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:22:41,881 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:41,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1930 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:22:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-10 00:22:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-10 00:22:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 428 states have (on average 1.5654205607476634) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 00:22:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 679 transitions. [2025-01-10 00:22:41,888 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 679 transitions. Word has length 88 [2025-01-10 00:22:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 679 transitions. [2025-01-10 00:22:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 679 transitions. [2025-01-10 00:22:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 00:22:41,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:41,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:22:41,890 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:41,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash -938637557, now seen corresponding path program 1 times [2025-01-10 00:22:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:41,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959140823] [2025-01-10 00:22:41,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:41,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:22:41,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:22:41,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:41,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:42,178 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:22:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959140823] [2025-01-10 00:22:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959140823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114246856] [2025-01-10 00:22:42,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:42,183 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:22:42,185 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:22:42,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:22:42,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:22:42,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:42,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:42,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:22:42,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:42,441 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:22:42,442 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:22:42,474 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:22:42,535 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:22:42,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:42,665 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:22:42,705 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:22:42,731 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:22:42,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114246856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:42,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-01-10 00:22:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796694229] [2025-01-10 00:22:42,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:22:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:42,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:22:42,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=317, Unknown=7, NotChecked=0, Total=380 [2025-01-10 00:22:42,784 INFO L87 Difference]: Start difference. First operand 600 states and 679 transitions. Second operand has 19 states, 16 states have (on average 7.125) internal successors, (114), 18 states have internal predecessors, (114), 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:22:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:43,906 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2025-01-10 00:22:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:22:43,906 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.125) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-01-10 00:22:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:43,908 INFO L225 Difference]: With dead ends: 607 [2025-01-10 00:22:43,908 INFO L226 Difference]: Without dead ends: 607 [2025-01-10 00:22:43,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=462, Unknown=7, NotChecked=0, Total=552 [2025-01-10 00:22:43,909 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 493 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:43,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 3072 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:22:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-10 00:22:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2025-01-10 00:22:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 432 states have (on average 1.5601851851851851) internal successors, (674), 597 states have internal predecessors, (674), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 681 transitions. [2025-01-10 00:22:43,916 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 681 transitions. Word has length 89 [2025-01-10 00:22:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:43,916 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 681 transitions. [2025-01-10 00:22:43,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.125) internal successors, (114), 18 states have internal predecessors, (114), 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:22:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 681 transitions. [2025-01-10 00:22:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 00:22:43,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:43,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:43,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:22:44,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:22:44,118 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:44,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -938637556, now seen corresponding path program 1 times [2025-01-10 00:22:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:44,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917823489] [2025-01-10 00:22:44,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:44,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:22:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:22:44,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:44,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:44,562 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:22:44,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917823489] [2025-01-10 00:22:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917823489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213270387] [2025-01-10 00:22:44,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:44,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:44,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:44,565 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:22:44,566 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:22:44,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 00:22:44,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 00:22:44,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:44,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:44,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 00:22:44,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:44,777 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:22:44,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:22:44,784 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:22:44,795 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:22:44,798 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:22:44,860 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:22:44,863 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:22:44,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:44,940 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:22:44,945 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:22:44,968 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:22:44,972 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:22:44,976 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:22:44,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213270387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:45,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-01-10 00:22:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021420224] [2025-01-10 00:22:45,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:22:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:45,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:22:45,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=243, Unknown=11, NotChecked=0, Total=306 [2025-01-10 00:22:45,082 INFO L87 Difference]: Start difference. First operand 604 states and 681 transitions. Second operand has 15 states, 12 states have (on average 9.0) internal successors, (108), 15 states have internal predecessors, (108), 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:22:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:46,068 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2025-01-10 00:22:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:22:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.0) internal successors, (108), 15 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2025-01-10 00:22:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:46,070 INFO L225 Difference]: With dead ends: 606 [2025-01-10 00:22:46,070 INFO L226 Difference]: Without dead ends: 606 [2025-01-10 00:22:46,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=368, Unknown=13, NotChecked=0, Total=462 [2025-01-10 00:22:46,071 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 473 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:46,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1855 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:22:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-10 00:22:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 597. [2025-01-10 00:22:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 427 states have (on average 1.5620608899297423) internal successors, (667), 591 states have internal predecessors, (667), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:22:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 673 transitions. [2025-01-10 00:22:46,079 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 673 transitions. Word has length 89 [2025-01-10 00:22:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 673 transitions. [2025-01-10 00:22:46,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.0) internal successors, (108), 15 states have internal predecessors, (108), 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:22:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 673 transitions. [2025-01-10 00:22:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:22:46,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:46,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:46,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:22:46,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 00:22:46,284 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:46,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1750514725, now seen corresponding path program 1 times [2025-01-10 00:22:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:46,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596827704] [2025-01-10 00:22:46,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:46,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:22:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:22:46,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:46,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:46,611 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:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:46,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596827704] [2025-01-10 00:22:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596827704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:46,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:46,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:22:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860640926] [2025-01-10 00:22:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:46,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:22:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:46,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:22:46,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:22:46,612 INFO L87 Difference]: Start difference. First operand 597 states and 673 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:47,464 INFO L93 Difference]: Finished difference Result 610 states and 689 transitions. [2025-01-10 00:22:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:22:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-01-10 00:22:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:47,465 INFO L225 Difference]: With dead ends: 610 [2025-01-10 00:22:47,465 INFO L226 Difference]: Without dead ends: 610 [2025-01-10 00:22:47,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:22:47,466 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 499 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:47,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2763 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:22:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-10 00:22:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2025-01-10 00:22:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 435 states have (on average 1.5563218390804598) internal successors, (677), 599 states have internal predecessors, (677), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 684 transitions. [2025-01-10 00:22:47,473 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 684 transitions. Word has length 91 [2025-01-10 00:22:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 684 transitions. [2025-01-10 00:22:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 684 transitions. [2025-01-10 00:22:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:22:47,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:47,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:47,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:22:47,474 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:47,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1750514726, now seen corresponding path program 1 times [2025-01-10 00:22:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713195554] [2025-01-10 00:22:47,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:47,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:22:47,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:22:47,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:47,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:47,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713195554] [2025-01-10 00:22:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713195554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:22:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595476220] [2025-01-10 00:22:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:22:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:47,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:22:47,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:22:47,874 INFO L87 Difference]: Start difference. First operand 606 states and 684 transitions. Second operand has 11 states, 10 states have (on average 8.9) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:48,593 INFO L93 Difference]: Finished difference Result 609 states and 688 transitions. [2025-01-10 00:22:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:22:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.9) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2025-01-10 00:22:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:48,595 INFO L225 Difference]: With dead ends: 609 [2025-01-10 00:22:48,595 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 00:22:48,595 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:22:48,595 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 474 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:48,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1854 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:22:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 00:22:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 606. [2025-01-10 00:22:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 435 states have (on average 1.554022988505747) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 683 transitions. [2025-01-10 00:22:48,608 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 683 transitions. Word has length 91 [2025-01-10 00:22:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:48,608 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 683 transitions. [2025-01-10 00:22:48,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.9) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 683 transitions. [2025-01-10 00:22:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:22:48,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:48,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:48,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:22:48,610 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:48,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1581208441, now seen corresponding path program 1 times [2025-01-10 00:22:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:48,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440581701] [2025-01-10 00:22:48,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:48,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:22:48,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:22:48,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:48,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440581701] [2025-01-10 00:22:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440581701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380418274] [2025-01-10 00:22:48,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:48,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:48,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:48,911 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:22:48,912 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:22:49,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:22:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:22:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:49,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:22:49,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:49,135 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:22:49,135 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:22:49,158 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:22:49,223 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:22:49,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:49,308 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:22:49,373 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:49,374 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:22:49,386 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:22:49,403 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:22:49,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:49,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (v_ArrVal_880 (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$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_877)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:22:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380418274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:49,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2025-01-10 00:22:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879008542] [2025-01-10 00:22:49,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:49,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:22:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:49,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:22:49,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=378, Unknown=16, NotChecked=40, Total=506 [2025-01-10 00:22:49,481 INFO L87 Difference]: Start difference. First operand 606 states and 683 transitions. Second operand has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 20 states have internal predecessors, (120), 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:22:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:50,259 INFO L93 Difference]: Finished difference Result 608 states and 687 transitions. [2025-01-10 00:22:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:22:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 20 states have internal predecessors, (120), 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 92 [2025-01-10 00:22:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:50,261 INFO L225 Difference]: With dead ends: 608 [2025-01-10 00:22:50,261 INFO L226 Difference]: Without dead ends: 608 [2025-01-10 00:22:50,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=413, Unknown=16, NotChecked=42, Total=552 [2025-01-10 00:22:50,261 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 465 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:50,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 2779 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:22:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-10 00:22:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2025-01-10 00:22:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 435 states have (on average 1.5517241379310345) internal successors, (675), 598 states have internal predecessors, (675), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 682 transitions. [2025-01-10 00:22:50,268 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 682 transitions. Word has length 92 [2025-01-10 00:22:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:50,269 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 682 transitions. [2025-01-10 00:22:50,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 20 states have internal predecessors, (120), 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:22:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 682 transitions. [2025-01-10 00:22:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 00:22:50,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:50,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:50,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:22:50,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:50,470 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:50,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:50,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1581208442, now seen corresponding path program 1 times [2025-01-10 00:22:50,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:50,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11314972] [2025-01-10 00:22:50,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:50,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:22:50,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:22:50,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:50,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:50,888 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:22:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11314972] [2025-01-10 00:22:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11314972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954110524] [2025-01-10 00:22:50,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:50,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:50,891 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:22:50,892 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:22:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 00:22:51,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 00:22:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:51,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 00:22:51,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:51,116 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:22:51,116 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:22:51,123 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:22:51,130 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:22:51,132 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:22:51,166 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:22:51,169 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:22:51,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:51,240 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:22:51,244 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:22:51,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:51,288 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:22:51,294 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:22:51,310 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:22:51,314 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:22:51,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:22:51,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:51,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1015 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2025-01-10 00:22:51,369 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1015 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:22:51,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1021) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1020))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1021) .cse1 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:22:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954110524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:51,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2025-01-10 00:22:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520603942] [2025-01-10 00:22:51,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:22:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:51,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:22:51,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-01-10 00:22:51,416 INFO L87 Difference]: Start difference. First operand 605 states and 682 transitions. Second operand has 16 states, 14 states have (on average 8.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:22:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:52,794 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2025-01-10 00:22:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:22:52,794 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-01-10 00:22:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:52,796 INFO L225 Difference]: With dead ends: 607 [2025-01-10 00:22:52,796 INFO L226 Difference]: Without dead ends: 607 [2025-01-10 00:22:52,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2025-01-10 00:22:52,796 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 487 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:52,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 3116 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:22:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-01-10 00:22:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 595. [2025-01-10 00:22:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 427 states have (on average 1.5573770491803278) internal successors, (665), 589 states have internal predecessors, (665), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:22:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 671 transitions. [2025-01-10 00:22:52,803 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 671 transitions. Word has length 92 [2025-01-10 00:22:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:52,803 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 671 transitions. [2025-01-10 00:22:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 00:22:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 671 transitions. [2025-01-10 00:22:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:22:52,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:52,807 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:22:52,813 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:22:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 00:22:53,011 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash 91876166, now seen corresponding path program 1 times [2025-01-10 00:22:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250655433] [2025-01-10 00:22:53,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:53,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:22:53,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:22:53,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:53,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:53,344 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:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250655433] [2025-01-10 00:22:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250655433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:53,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:53,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:22:53,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465440062] [2025-01-10 00:22:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:53,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:22:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:53,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:22:53,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:22:53,346 INFO L87 Difference]: Start difference. First operand 595 states and 671 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:54,242 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2025-01-10 00:22:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:22:54,245 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-01-10 00:22:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:54,246 INFO L225 Difference]: With dead ends: 611 [2025-01-10 00:22:54,246 INFO L226 Difference]: Without dead ends: 611 [2025-01-10 00:22:54,246 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:22:54,247 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 500 mSDsluCounter, 3039 mSDsCounter, 0 mSdLazyCounter, 2609 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:54,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3358 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2609 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:22:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-01-10 00:22:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2025-01-10 00:22:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 438 states have (on average 1.547945205479452) internal successors, (678), 600 states have internal predecessors, (678), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 685 transitions. [2025-01-10 00:22:54,254 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 685 transitions. Word has length 94 [2025-01-10 00:22:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:54,254 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 685 transitions. [2025-01-10 00:22:54,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 685 transitions. [2025-01-10 00:22:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:22:54,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:54,255 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:22:54,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:22:54,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:54,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash 91876167, now seen corresponding path program 1 times [2025-01-10 00:22:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712176604] [2025-01-10 00:22:54,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:54,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:54,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:22:54,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:22:54,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:54,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:54,676 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:54,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712176604] [2025-01-10 00:22:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712176604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:22:54,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:22:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:22:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854975504] [2025-01-10 00:22:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:22:54,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:22:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:54,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:22:54,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:22:54,678 INFO L87 Difference]: Start difference. First operand 607 states and 685 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:55,469 INFO L93 Difference]: Finished difference Result 610 states and 689 transitions. [2025-01-10 00:22:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:22:55,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2025-01-10 00:22:55,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:55,471 INFO L225 Difference]: With dead ends: 610 [2025-01-10 00:22:55,471 INFO L226 Difference]: Without dead ends: 610 [2025-01-10 00:22:55,471 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:22:55,471 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 492 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:55,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1856 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:22:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-10 00:22:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2025-01-10 00:22:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 438 states have (on average 1.5456621004566211) internal successors, (677), 600 states have internal predecessors, (677), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 684 transitions. [2025-01-10 00:22:55,478 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 684 transitions. Word has length 94 [2025-01-10 00:22:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:55,478 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 684 transitions. [2025-01-10 00:22:55,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:22:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 684 transitions. [2025-01-10 00:22:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:22:55,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:55,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:22:55,479 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:55,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:55,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1420024974, now seen corresponding path program 1 times [2025-01-10 00:22:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427949154] [2025-01-10 00:22:55,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:55,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:22:55,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:22:55,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:55,827 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:22:55,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427949154] [2025-01-10 00:22:55,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427949154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750381367] [2025-01-10 00:22:55,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:55,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:55,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:55,830 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:22:55,830 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:22:55,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:22:55,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:22:55,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:55,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:55,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:22:55,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:56,055 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:22:56,055 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:22:56,078 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:22:56,134 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:22:56,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:56,222 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:22:56,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:56,290 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:22:56,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:56,326 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:22:56,336 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:22:56,365 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:22:56,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:56,401 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:22:56,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (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$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1293))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1294)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:22:56,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (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$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1297))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1293)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1294)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:22:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750381367] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:56,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2025-01-10 00:22:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829354853] [2025-01-10 00:22:56,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:56,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:22:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:56,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:22:56,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=491, Unknown=24, NotChecked=144, Total=756 [2025-01-10 00:22:56,444 INFO L87 Difference]: Start difference. First operand 607 states and 684 transitions. Second operand has 23 states, 20 states have (on average 6.3) internal successors, (126), 23 states have internal predecessors, (126), 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:22:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:22:57,531 INFO L93 Difference]: Finished difference Result 609 states and 688 transitions. [2025-01-10 00:22:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:22:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.3) internal successors, (126), 23 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-01-10 00:22:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:22:57,532 INFO L225 Difference]: With dead ends: 609 [2025-01-10 00:22:57,532 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 00:22:57,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=530, Unknown=25, NotChecked=150, Total=812 [2025-01-10 00:22:57,533 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 477 mSDsluCounter, 3652 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:22:57,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3973 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:22:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 00:22:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 606. [2025-01-10 00:22:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 438 states have (on average 1.54337899543379) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:22:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 683 transitions. [2025-01-10 00:22:57,542 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 683 transitions. Word has length 95 [2025-01-10 00:22:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:22:57,542 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 683 transitions. [2025-01-10 00:22:57,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.3) internal successors, (126), 23 states have internal predecessors, (126), 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:22:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 683 transitions. [2025-01-10 00:22:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 00:22:57,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:22:57,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:22:57,550 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:22:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:22:57,747 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:22:57,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:22:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1420024973, now seen corresponding path program 1 times [2025-01-10 00:22:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:22:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759601409] [2025-01-10 00:22:57,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:22:57,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:22:57,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:22:57,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:57,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:22:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:22:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759601409] [2025-01-10 00:22:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759601409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161990261] [2025-01-10 00:22:58,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:22:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:22:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:22:58,220 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:22:58,222 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:22:58,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 00:22:58,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 00:22:58,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:22:58,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:22:58,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:22:58,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:22:58,432 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:22:58,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:22:58,437 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:22:58,447 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:22:58,453 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:22:58,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:58,496 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:22:58,498 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 20 treesize of output 1 [2025-01-10 00:22:58,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:58,533 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:22:58,535 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 40 treesize of output 23 [2025-01-10 00:22:58,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:22:58,603 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:22:58,608 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 51 treesize of output 32 [2025-01-10 00:22:58,637 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:22:58,638 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 34 treesize of output 16 [2025-01-10 00:22:58,651 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:22:58,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:22:58,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1452))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1451)) (.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)) (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse3 (store .cse1 .cse0 v_ArrVal_1444))) (or (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1443 (Array Int Int))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1443))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store .cse3 .cse4 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))))) (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1452))) (let ((.cse8 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1451)) (.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< (select |c_#length| .cse7) (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)) (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse9 (store .cse8 .cse7 v_ArrVal_1444))) (or (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1443 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse9 (select (select (store .cse10 .cse7 v_ArrVal_1443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))))))) is different from false [2025-01-10 00:22:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161990261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:22:58,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:22:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2025-01-10 00:22:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639428932] [2025-01-10 00:22:58,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:22:58,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:22:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:22:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:22:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2025-01-10 00:22:58,989 INFO L87 Difference]: Start difference. First operand 606 states and 683 transitions. Second operand has 22 states, 19 states have (on average 6.368421052631579) internal successors, (121), 22 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:00,366 INFO L93 Difference]: Finished difference Result 608 states and 687 transitions. [2025-01-10 00:23:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:23:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.368421052631579) internal successors, (121), 22 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-01-10 00:23:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:00,368 INFO L225 Difference]: With dead ends: 608 [2025-01-10 00:23:00,368 INFO L226 Difference]: Without dead ends: 608 [2025-01-10 00:23:00,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=940, Unknown=1, NotChecked=64, Total=1190 [2025-01-10 00:23:00,368 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 487 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 3487 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:00,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 3539 Invalid, 3504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3487 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:23:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-10 00:23:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 593. [2025-01-10 00:23:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 427 states have (on average 1.5526932084309133) internal successors, (663), 587 states have internal predecessors, (663), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:23:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 669 transitions. [2025-01-10 00:23:00,374 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 669 transitions. Word has length 95 [2025-01-10 00:23:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:00,374 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 669 transitions. [2025-01-10 00:23:00,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.368421052631579) internal successors, (121), 22 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 669 transitions. [2025-01-10 00:23:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:23:00,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:00,375 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:00,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:23:00,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 00:23:00,576 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:00,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1189312428, now seen corresponding path program 1 times [2025-01-10 00:23:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:00,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281854091] [2025-01-10 00:23:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:00,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:23:00,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:23:00,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:00,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:00,948 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,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:00,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281854091] [2025-01-10 00:23:00,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281854091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:00,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-10 00:23:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207529142] [2025-01-10 00:23:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:00,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:23:00,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:23:00,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:23:00,950 INFO L87 Difference]: Start difference. First operand 593 states and 669 transitions. Second operand has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:01,814 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2025-01-10 00:23:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:23:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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 97 [2025-01-10 00:23:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:01,816 INFO L225 Difference]: With dead ends: 612 [2025-01-10 00:23:01,816 INFO L226 Difference]: Without dead ends: 612 [2025-01-10 00:23:01,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-01-10 00:23:01,817 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 482 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:01,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 3049 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:23:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-10 00:23:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2025-01-10 00:23:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 441 states have (on average 1.5396825396825398) internal successors, (679), 601 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 686 transitions. [2025-01-10 00:23:01,821 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 686 transitions. Word has length 97 [2025-01-10 00:23:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:01,821 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 686 transitions. [2025-01-10 00:23:01,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 686 transitions. [2025-01-10 00:23:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:23:01,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:01,822 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:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:23:01,822 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:01,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1189312429, now seen corresponding path program 1 times [2025-01-10 00:23:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:01,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784095810] [2025-01-10 00:23:01,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:01,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 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 97 of 97 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:02,298 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,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784095810] [2025-01-10 00:23:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784095810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:23:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184896272] [2025-01-10 00:23:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:02,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:23:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:02,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:23:02,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:23:02,300 INFO L87 Difference]: Start difference. First operand 608 states and 686 transitions. Second operand has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:03,542 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2025-01-10 00:23:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:23:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2025-01-10 00:23:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:03,543 INFO L225 Difference]: With dead ends: 611 [2025-01-10 00:23:03,544 INFO L226 Difference]: Without dead ends: 611 [2025-01-10 00:23:03,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:23:03,544 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 476 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:03,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2806 Invalid, 3120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 00:23:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-01-10 00:23:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 608. [2025-01-10 00:23:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 441 states have (on average 1.5374149659863945) internal successors, (678), 601 states have internal predecessors, (678), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 685 transitions. [2025-01-10 00:23:03,549 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 685 transitions. Word has length 97 [2025-01-10 00:23:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 685 transitions. [2025-01-10 00:23:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 685 transitions. [2025-01-10 00:23:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:23:03,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:03,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 00:23:03,550 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1464483840, now seen corresponding path program 1 times [2025-01-10 00:23:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126606225] [2025-01-10 00:23:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:03,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:23:03,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:23:03,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:03,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:03,960 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:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126606225] [2025-01-10 00:23:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126606225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140247124] [2025-01-10 00:23:03,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:03,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:03,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:03,962 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:03,964 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:04,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:23:04,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:23:04,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:04,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:04,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 00:23:04,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:04,185 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:04,185 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:04,206 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:04,256 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:04,354 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:04,354 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:04,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:04,417 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:04,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:04,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:23:04,513 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:04,513 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:04,521 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:04,547 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:04,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:04,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1749 (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$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1749))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:04,640 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (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$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1748))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1749)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:04,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1748))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1749)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:04,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (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$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1753))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1748)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1749)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:23:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140247124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:04,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2025-01-10 00:23:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262132019] [2025-01-10 00:23:04,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:23:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:04,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:23:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=675, Unknown=25, NotChecked=228, Total=1056 [2025-01-10 00:23:04,671 INFO L87 Difference]: Start difference. First operand 608 states and 685 transitions. Second operand has 26 states, 23 states have (on average 5.739130434782608) internal successors, (132), 25 states have internal predecessors, (132), 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:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:06,119 INFO L93 Difference]: Finished difference Result 610 states and 689 transitions. [2025-01-10 00:23:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:23:06,119 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.739130434782608) internal successors, (132), 25 states have internal predecessors, (132), 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 98 [2025-01-10 00:23:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:06,121 INFO L225 Difference]: With dead ends: 610 [2025-01-10 00:23:06,121 INFO L226 Difference]: Without dead ends: 610 [2025-01-10 00:23:06,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=832, Unknown=25, NotChecked=252, Total=1260 [2025-01-10 00:23:06,122 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 451 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 4832 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:06,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 4832 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-10 00:23:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-10 00:23:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2025-01-10 00:23:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 441 states have (on average 1.5351473922902494) internal successors, (677), 600 states have internal predecessors, (677), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 684 transitions. [2025-01-10 00:23:06,128 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 684 transitions. Word has length 98 [2025-01-10 00:23:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:06,128 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 684 transitions. [2025-01-10 00:23:06,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.739130434782608) internal successors, (132), 25 states have internal predecessors, (132), 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:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 684 transitions. [2025-01-10 00:23:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:23:06,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:06,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:06,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:23:06,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:06,329 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:06,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1464483841, now seen corresponding path program 1 times [2025-01-10 00:23:06,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989038531] [2025-01-10 00:23:06,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:23:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:23:06,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:06,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:06,980 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:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989038531] [2025-01-10 00:23:06,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989038531] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:06,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161187828] [2025-01-10 00:23:06,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:06,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:06,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:06,983 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:06,985 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:07,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:23:07,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:23:07,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:07,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:07,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 00:23:07,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:07,213 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:07,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:23:07,218 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:07,236 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:07,238 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:07,292 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:07,295 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:07,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:07,360 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:07,366 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:07,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:07,415 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:07,419 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:07,460 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:07,460 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:07,464 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:07,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:07,517 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:07,524 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:07,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:23:07,538 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:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:07,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:07,643 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1916 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:23:07,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1915))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1914) .cse0 v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-01-10 00:23:07,669 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1914) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1915))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1914) .cse2 v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:23:07,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1912))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1915))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1913) .cse0 v_ArrVal_1914) .cse1 v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1912))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1913) .cse5 v_ArrVal_1914) (select (select (store .cse6 .cse5 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1916))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-01-10 00:23:07,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1922))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1912))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1923) .cse0 v_ArrVal_1913) .cse1 v_ArrVal_1914) (select (select (store .cse2 .cse1 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1916))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1922))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1912))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1915))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1923) .cse5 v_ArrVal_1913) .cse6 v_ArrVal_1914) .cse7 v_ArrVal_1916) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-01-10 00:23:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161187828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:07,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2025-01-10 00:23:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877284170] [2025-01-10 00:23:07,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:07,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:23:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:07,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:23:07,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=632, Unknown=31, NotChecked=280, Total=1056 [2025-01-10 00:23:07,893 INFO L87 Difference]: Start difference. First operand 607 states and 684 transitions. Second operand has 24 states, 21 states have (on average 6.285714285714286) internal successors, (132), 24 states have internal predecessors, (132), 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:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:09,322 INFO L93 Difference]: Finished difference Result 609 states and 688 transitions. [2025-01-10 00:23:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:23:09,322 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.285714285714286) internal successors, (132), 24 states have internal predecessors, (132), 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 98 [2025-01-10 00:23:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:09,324 INFO L225 Difference]: With dead ends: 609 [2025-01-10 00:23:09,324 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 00:23:09,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=996, Unknown=31, NotChecked=350, Total=1560 [2025-01-10 00:23:09,324 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 466 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:09,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 3063 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:23:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 00:23:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 591. [2025-01-10 00:23:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 427 states have (on average 1.5480093676814988) internal successors, (661), 585 states have internal predecessors, (661), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:23:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 667 transitions. [2025-01-10 00:23:09,330 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 667 transitions. Word has length 98 [2025-01-10 00:23:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 667 transitions. [2025-01-10 00:23:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.285714285714286) internal successors, (132), 24 states have internal predecessors, (132), 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:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 667 transitions. [2025-01-10 00:23:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:23:09,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:09,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:09,338 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:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 00:23:09,531 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:09,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1259359378, now seen corresponding path program 1 times [2025-01-10 00:23:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:09,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469043226] [2025-01-10 00:23:09,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:23:09,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:23:09,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:09,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:10,001 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:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469043226] [2025-01-10 00:23:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469043226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:23:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658271984] [2025-01-10 00:23:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:23:10,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:10,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:23:10,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:23:10,002 INFO L87 Difference]: Start difference. First operand 591 states and 667 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:23:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:10,705 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2025-01-10 00:23:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:23:10,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2025-01-10 00:23:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:10,706 INFO L225 Difference]: With dead ends: 614 [2025-01-10 00:23:10,706 INFO L226 Difference]: Without dead ends: 614 [2025-01-10 00:23:10,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:23:10,707 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 496 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:10,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2444 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:23:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-10 00:23:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 610. [2025-01-10 00:23:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 445 states have (on average 1.5303370786516854) internal successors, (681), 603 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 688 transitions. [2025-01-10 00:23:10,712 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 688 transitions. Word has length 101 [2025-01-10 00:23:10,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:10,712 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 688 transitions. [2025-01-10 00:23:10,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:23:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 688 transitions. [2025-01-10 00:23:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-10 00:23:10,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:10,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:23:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 00:23:10,713 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:10,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1259359377, now seen corresponding path program 1 times [2025-01-10 00:23:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:10,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33578070] [2025-01-10 00:23:10,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:10,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-10 00:23:10,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-10 00:23:10,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:10,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:11,449 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:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33578070] [2025-01-10 00:23:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33578070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-10 00:23:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604025690] [2025-01-10 00:23:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:23:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:11,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:23:11,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:23:11,451 INFO L87 Difference]: Start difference. First operand 610 states and 688 transitions. Second operand has 18 states, 16 states have (on average 6.1875) internal successors, (99), 17 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:23:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:12,837 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2025-01-10 00:23:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:23:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.1875) internal successors, (99), 17 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2025-01-10 00:23:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:12,839 INFO L225 Difference]: With dead ends: 613 [2025-01-10 00:23:12,839 INFO L226 Difference]: Without dead ends: 613 [2025-01-10 00:23:12,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-01-10 00:23:12,840 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 494 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 3479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:12,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 3050 Invalid, 3479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:23:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-01-10 00:23:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2025-01-10 00:23:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 445 states have (on average 1.5280898876404494) internal successors, (680), 603 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 687 transitions. [2025-01-10 00:23:12,844 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 687 transitions. Word has length 101 [2025-01-10 00:23:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 687 transitions. [2025-01-10 00:23:12,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.1875) internal successors, (99), 17 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:23:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 687 transitions. [2025-01-10 00:23:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:23:12,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:12,845 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:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 00:23:12,845 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:12,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 693252546, now seen corresponding path program 1 times [2025-01-10 00:23:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43589382] [2025-01-10 00:23:12,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:12,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:23:12,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:23:12,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:12,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:13,389 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:13,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43589382] [2025-01-10 00:23:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43589382] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902126731] [2025-01-10 00:23:13,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:13,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:13,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:13,392 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:13,392 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:13,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:23:13,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:23:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:13,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 00:23:13,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:13,639 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:13,639 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:13,660 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:13,705 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:13,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:13,792 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:13,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:13,842 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:13,885 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:13,885 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:13,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:13,919 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:13,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:13,957 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:13,967 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:14,015 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-10 00:23:14,016 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:23:14,020 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:14,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:14,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902126731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:14,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:14,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2025-01-10 00:23:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822001379] [2025-01-10 00:23:14,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:14,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 00:23:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:14,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 00:23:14,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1169, Unknown=51, NotChecked=0, Total=1406 [2025-01-10 00:23:14,507 INFO L87 Difference]: Start difference. First operand 610 states and 687 transitions. Second operand has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:15,349 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2025-01-10 00:23:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:23:15,350 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-01-10 00:23:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:15,351 INFO L225 Difference]: With dead ends: 612 [2025-01-10 00:23:15,351 INFO L226 Difference]: Without dead ends: 612 [2025-01-10 00:23:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1230, Unknown=51, NotChecked=0, Total=1482 [2025-01-10 00:23:15,354 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 451 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 2774 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:23:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-10 00:23:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2025-01-10 00:23:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 445 states have (on average 1.5258426966292136) internal successors, (679), 602 states have internal predecessors, (679), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 686 transitions. [2025-01-10 00:23:15,362 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 686 transitions. Word has length 102 [2025-01-10 00:23:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:15,363 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 686 transitions. [2025-01-10 00:23:15,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.833333333333333) internal successors, (140), 27 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 686 transitions. [2025-01-10 00:23:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 00:23:15,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:15,363 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:15,375 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:23:15,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:15,564 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:15,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 693252547, now seen corresponding path program 1 times [2025-01-10 00:23:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866211007] [2025-01-10 00:23:15,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:15,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:23:15,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:23:15,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:16,323 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:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866211007] [2025-01-10 00:23:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866211007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315031515] [2025-01-10 00:23:16,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:23:16,326 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:23:16,326 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:23:16,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 00:23:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 00:23:16,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:16,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:16,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-10 00:23:16,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:23:16,588 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:23:16,588 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:16,594 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:16,619 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:16,622 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:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-01-10 00:23:16,721 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:16,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:16,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-10 00:23:16,855 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:16,948 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:16,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-10 00:23:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:23:17,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:17,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-10 00:23:17,013 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:17,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:17,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-10 00:23:17,076 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:17,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:23:17,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-01-10 00:23:17,141 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:17,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2025-01-10 00:23:17,159 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:17,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:23:17,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:23:17,196 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-10 00:23:17,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:23:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:17,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:23:17,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ 1 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2439) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2438) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (or (forall ((v_ArrVal_2442 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2438))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2439) .cse1 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2442) (select (select (store .cse2 .cse1 v_ArrVal_2441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2025-01-10 00:23:17,683 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ 1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2437))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2436) .cse1 v_ArrVal_2439) (select (select (store .cse2 .cse1 v_ArrVal_2438) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2440))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (or (forall ((v_ArrVal_2442 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2437))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2438))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2436) .cse4 v_ArrVal_2439) .cse5 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2442) (select (select (store .cse6 .cse5 v_ArrVal_2441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2025-01-10 00:23:17,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2434))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2437))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2435) .cse0 v_ArrVal_2436) .cse1 v_ArrVal_2439) (select (select (store .cse2 .cse1 v_ArrVal_2438) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2440))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)) (forall ((v_ArrVal_2442 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2434))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2437))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2438))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2435) .cse5 v_ArrVal_2436) .cse6 v_ArrVal_2439) .cse7 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2442) (select (select (store .cse8 .cse7 v_ArrVal_2441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2025-01-10 00:23:22,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2447))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2434))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2437))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2448) .cse0 v_ArrVal_2435) .cse1 v_ArrVal_2436) .cse2 v_ArrVal_2439) (select (select (store .cse3 .cse2 v_ArrVal_2438) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2440))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2447 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (or (forall ((v_ArrVal_2442 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2447))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2434))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2437))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2438))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2448) .cse7 v_ArrVal_2435) .cse8 v_ArrVal_2436) .cse9 v_ArrVal_2439) .cse10 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2442) (select (select (store .cse11 .cse10 v_ArrVal_2441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2025-01-10 00:23:22,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315031515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:23:22,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:23:22,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2025-01-10 00:23:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422703203] [2025-01-10 00:23:22,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:23:22,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 00:23:22,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:22,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 00:23:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1155, Unknown=29, NotChecked=292, Total=1640 [2025-01-10 00:23:22,797 INFO L87 Difference]: Start difference. First operand 609 states and 686 transitions. Second operand has 29 states, 26 states have (on average 5.384615384615385) internal successors, (140), 29 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:40,541 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2025-01-10 00:23:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:23:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.384615384615385) internal successors, (140), 29 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-01-10 00:23:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:40,543 INFO L225 Difference]: With dead ends: 611 [2025-01-10 00:23:40,543 INFO L226 Difference]: Without dead ends: 611 [2025-01-10 00:23:40,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=195, Invalid=1274, Unknown=29, NotChecked=308, Total=1806 [2025-01-10 00:23:40,544 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 464 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 4869 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 4884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:40,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 5192 Invalid, 4884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4869 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2025-01-10 00:23:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-01-10 00:23:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2025-01-10 00:23:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 427 states have (on average 1.5433255269320842) internal successors, (659), 583 states have internal predecessors, (659), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:23:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 665 transitions. [2025-01-10 00:23:40,549 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 665 transitions. Word has length 102 [2025-01-10 00:23:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:40,549 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 665 transitions. [2025-01-10 00:23:40,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.384615384615385) internal successors, (140), 29 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:23:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 665 transitions. [2025-01-10 00:23:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 00:23:40,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:40,550 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] [2025-01-10 00:23:40,557 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:23:40,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:23:40,751 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:40,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1035265869, now seen corresponding path program 1 times [2025-01-10 00:23:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:40,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603701354] [2025-01-10 00:23:40,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 00:23:40,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 00:23:40,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:40,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:23:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603701354] [2025-01-10 00:23:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603701354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:23:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199829895] [2025-01-10 00:23:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:41,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:23:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:41,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:23:41,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:23:41,811 INFO L87 Difference]: Start difference. First operand 589 states and 665 transitions. Second operand has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:23:48,691 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2025-01-10 00:23:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:23:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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 104 [2025-01-10 00:23:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:23:48,693 INFO L225 Difference]: With dead ends: 615 [2025-01-10 00:23:48,693 INFO L226 Difference]: Without dead ends: 615 [2025-01-10 00:23:48,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-01-10 00:23:48,694 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 481 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:23:48,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2167 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-01-10 00:23:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-10 00:23:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2025-01-10 00:23:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 448 states have (on average 1.5223214285714286) internal successors, (682), 604 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:23:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 689 transitions. [2025-01-10 00:23:48,698 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 689 transitions. Word has length 104 [2025-01-10 00:23:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:23:48,698 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 689 transitions. [2025-01-10 00:23:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 689 transitions. [2025-01-10 00:23:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 00:23:48,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:23:48,699 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] [2025-01-10 00:23:48,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 00:23:48,699 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:23:48,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:23:48,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1035265868, now seen corresponding path program 1 times [2025-01-10 00:23:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:23:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249949193] [2025-01-10 00:23:48,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:23:48,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:23:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 00:23:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 00:23:48,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:23:48,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:23:50,979 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:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:23:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249949193] [2025-01-10 00:23:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249949193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:23:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:23:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-10 00:23:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191248636] [2025-01-10 00:23:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:23:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:23:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:23:50,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:23:50,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:23:50,981 INFO L87 Difference]: Start difference. First operand 611 states and 689 transitions. Second operand has 19 states, 17 states have (on average 6.0) internal successors, (102), 18 states have internal predecessors, (102), 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:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:01,184 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2025-01-10 00:24:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:24:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.0) internal successors, (102), 18 states have internal predecessors, (102), 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 104 [2025-01-10 00:24:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:01,187 INFO L225 Difference]: With dead ends: 614 [2025-01-10 00:24:01,187 INFO L226 Difference]: Without dead ends: 614 [2025-01-10 00:24:01,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-01-10 00:24:01,187 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 496 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:01,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2387 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-01-10 00:24:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-10 00:24:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2025-01-10 00:24:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 448 states have (on average 1.5200892857142858) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 00:24:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2025-01-10 00:24:01,193 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 104 [2025-01-10 00:24:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:01,193 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2025-01-10 00:24:01,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.0) internal successors, (102), 18 states have internal predecessors, (102), 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:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2025-01-10 00:24:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 00:24:01,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:01,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, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 00:24:01,194 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-01-10 00:24:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1810495009, now seen corresponding path program 1 times [2025-01-10 00:24:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38188435] [2025-01-10 00:24:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:01,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 00:24:01,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 00:24:01,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:01,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:24:01,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38188435] [2025-01-10 00:24:01,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38188435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:01,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:24:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940659218] [2025-01-10 00:24:01,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:01,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:24:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:01,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:24:01,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:01,717 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)