./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-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_test4-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 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:24:42,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:24:42,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:24:42,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:24:42,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:24:42,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:24:42,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:24:42,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:24:42,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:24:42,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:24:42,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:24:42,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:24:42,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:24:42,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:24:42,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:24:42,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:24:42,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:24:42,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:24:42,442 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2025-01-10 00:24:42,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:24:42,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:24:42,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:24:42,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:24:42,676 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:24:42,677 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_test4-1.i [2025-01-10 00:24:43,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce3597c7e/1730f49cee3046ab85c97d81773b08b5/FLAGacbc96f06 [2025-01-10 00:24:44,075 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:24:44,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2025-01-10 00:24:44,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce3597c7e/1730f49cee3046ab85c97d81773b08b5/FLAGacbc96f06 [2025-01-10 00:24:44,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce3597c7e/1730f49cee3046ab85c97d81773b08b5 [2025-01-10 00:24:44,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:24:44,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:24:44,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:24:44,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:24:44,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:24:44,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2308a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44, skipping insertion in model container [2025-01-10 00:24:44,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:24:44,630 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,652 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,658 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,663 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,696 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,702 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:24:44,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:24:44,721 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:24:44,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:24:44,822 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:24:44,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44 WrapperNode [2025-01-10 00:24:44,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:24:44,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:24:44,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:24:44,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:24:44,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,890 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1557 [2025-01-10 00:24:44,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:24:44,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:24:44,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:24:44,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:24:44,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,975 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [307, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 82 writes are split as follows [82, 0]. [2025-01-10 00:24:44,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:44,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:24:45,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:24:45,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:24:45,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:24:45,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (1/1) ... [2025-01-10 00:24:45,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:24:45,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:45,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:24:45,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:24:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:24:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:24:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 00:24:45,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 00:24:45,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 00:24:45,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:24:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:24:45,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:24:45,270 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:24:45,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:24:45,273 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:24:45,300 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-10 00:24:47,100 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2025-01-10 00:24:47,100 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:24:47,133 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:24:47,133 INFO L312 CfgBuilder]: Removed 28 assume(true) statements. [2025-01-10 00:24:47,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:24:47 BoogieIcfgContainer [2025-01-10 00:24:47,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:24:47,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:24:47,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:24:47,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:24:47,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:24:44" (1/3) ... [2025-01-10 00:24:47,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c8953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:24:47, skipping insertion in model container [2025-01-10 00:24:47,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:24:44" (2/3) ... [2025-01-10 00:24:47,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c8953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:24:47, skipping insertion in model container [2025-01-10 00:24:47,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:24:47" (3/3) ... [2025-01-10 00:24:47,142 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2025-01-10 00:24:47,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:24:47,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test4-1.i that has 4 procedures, 1451 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2025-01-10 00:24:47,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:24:47,217 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;@344ddad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:24:47,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-01-10 00:24:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 1446 states, 805 states have (on average 2.075776397515528) internal successors, (1671), 1437 states have internal predecessors, (1671), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:24:47,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:47,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:24:47,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr626ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:47,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash 48331457, now seen corresponding path program 1 times [2025-01-10 00:24:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78681350] [2025-01-10 00:24:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:47,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:24:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:24:47,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78681350] [2025-01-10 00:24:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78681350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:47,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:47,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662729739] [2025-01-10 00:24:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:47,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:47,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:47,406 INFO L87 Difference]: Start difference. First operand has 1446 states, 805 states have (on average 2.075776397515528) internal successors, (1671), 1437 states have internal predecessors, (1671), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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:24:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:47,559 INFO L93 Difference]: Finished difference Result 2802 states and 3170 transitions. [2025-01-10 00:24:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:47,561 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:24:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:47,584 INFO L225 Difference]: With dead ends: 2802 [2025-01-10 00:24:47,585 INFO L226 Difference]: Without dead ends: 2800 [2025-01-10 00:24:47,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:47,589 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 1536 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:47,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 3231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2025-01-10 00:24:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 1426. [2025-01-10 00:24:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 796 states have (on average 1.9949748743718594) internal successors, (1588), 1417 states have internal predecessors, (1588), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1620 transitions. [2025-01-10 00:24:47,693 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1620 transitions. Word has length 5 [2025-01-10 00:24:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:47,695 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1620 transitions. [2025-01-10 00:24:47,695 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:24:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1620 transitions. [2025-01-10 00:24:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:24:47,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:47,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:24:47,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:24:47,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:47,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 45872344, now seen corresponding path program 1 times [2025-01-10 00:24:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:47,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070919927] [2025-01-10 00:24:47,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:47,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:24:47,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:24:47,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:47,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:47,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070919927] [2025-01-10 00:24:47,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070919927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:47,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:47,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:24:47,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66565284] [2025-01-10 00:24:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:47,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:47,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:47,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:47,773 INFO L87 Difference]: Start difference. First operand 1426 states and 1620 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:24:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:48,567 INFO L93 Difference]: Finished difference Result 1332 states and 1526 transitions. [2025-01-10 00:24:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:48,567 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:24:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:48,572 INFO L225 Difference]: With dead ends: 1332 [2025-01-10 00:24:48,572 INFO L226 Difference]: Without dead ends: 1332 [2025-01-10 00:24:48,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:48,574 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 1361 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:48,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 922 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:24:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-01-10 00:24:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2025-01-10 00:24:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 796 states have (on average 1.8768844221105527) internal successors, (1494), 1323 states have internal predecessors, (1494), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1526 transitions. [2025-01-10 00:24:48,601 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1526 transitions. Word has length 5 [2025-01-10 00:24:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:48,601 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1526 transitions. [2025-01-10 00:24:48,601 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:24:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1526 transitions. [2025-01-10 00:24:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 00:24:48,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:48,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:24:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:24:48,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash 45872345, now seen corresponding path program 1 times [2025-01-10 00:24:48,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648370264] [2025-01-10 00:24:48,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:48,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:48,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:24:48,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:24:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648370264] [2025-01-10 00:24:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648370264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:24:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697711567] [2025-01-10 00:24:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:48,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:48,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:48,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:48,696 INFO L87 Difference]: Start difference. First operand 1332 states and 1526 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:24:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:49,460 INFO L93 Difference]: Finished difference Result 1746 states and 2018 transitions. [2025-01-10 00:24:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:49,460 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:24:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:49,466 INFO L225 Difference]: With dead ends: 1746 [2025-01-10 00:24:49,467 INFO L226 Difference]: Without dead ends: 1746 [2025-01-10 00:24:49,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:49,467 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 817 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:49,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1934 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:24:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2025-01-10 00:24:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1594. [2025-01-10 00:24:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1068 states have (on average 1.841760299625468) internal successors, (1967), 1585 states have internal predecessors, (1967), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1999 transitions. [2025-01-10 00:24:49,522 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1999 transitions. Word has length 5 [2025-01-10 00:24:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:49,522 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 1999 transitions. [2025-01-10 00:24:49,522 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:24:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1999 transitions. [2025-01-10 00:24:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:24:49,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:49,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:49,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:24:49,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:49,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash -459415550, now seen corresponding path program 1 times [2025-01-10 00:24:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:49,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655127843] [2025-01-10 00:24:49,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:49,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:24:49,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:24:49,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:49,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655127843] [2025-01-10 00:24:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655127843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148650381] [2025-01-10 00:24:49,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:49,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:49,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:49,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:49,604 INFO L87 Difference]: Start difference. First operand 1594 states and 1999 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:50,479 INFO L93 Difference]: Finished difference Result 1620 states and 2052 transitions. [2025-01-10 00:24:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 00:24:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:50,487 INFO L225 Difference]: With dead ends: 1620 [2025-01-10 00:24:50,488 INFO L226 Difference]: Without dead ends: 1620 [2025-01-10 00:24:50,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:50,489 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 1628 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 1621 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:24:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-01-10 00:24:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1571. [2025-01-10 00:24:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1068 states have (on average 1.8202247191011236) internal successors, (1944), 1562 states have internal predecessors, (1944), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1976 transitions. [2025-01-10 00:24:50,516 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1976 transitions. Word has length 11 [2025-01-10 00:24:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:50,516 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 1976 transitions. [2025-01-10 00:24:50,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1976 transitions. [2025-01-10 00:24:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:24:50,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:50,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:24:50,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash -459415549, now seen corresponding path program 1 times [2025-01-10 00:24:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583513295] [2025-01-10 00:24:50,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:24:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:24:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:50,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583513295] [2025-01-10 00:24:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583513295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:50,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:50,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183806628] [2025-01-10 00:24:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:50,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:50,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:50,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:50,590 INFO L87 Difference]: Start difference. First operand 1571 states and 1976 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:50,621 INFO L93 Difference]: Finished difference Result 1496 states and 1873 transitions. [2025-01-10 00:24:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 00:24:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:50,627 INFO L225 Difference]: With dead ends: 1496 [2025-01-10 00:24:50,627 INFO L226 Difference]: Without dead ends: 1496 [2025-01-10 00:24:50,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:50,628 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 60 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:50,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2703 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-01-10 00:24:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2025-01-10 00:24:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1005 states have (on average 1.8318407960199006) internal successors, (1841), 1487 states have internal predecessors, (1841), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1873 transitions. [2025-01-10 00:24:50,656 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1873 transitions. Word has length 11 [2025-01-10 00:24:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:50,657 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1873 transitions. [2025-01-10 00:24:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1873 transitions. [2025-01-10 00:24:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 00:24:50,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:50,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:50,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:24:50,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1356764593, now seen corresponding path program 1 times [2025-01-10 00:24:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414981368] [2025-01-10 00:24:50,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:50,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:24:50,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:24:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:50,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414981368] [2025-01-10 00:24:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414981368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457551651] [2025-01-10 00:24:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:50,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:50,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:50,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:50,736 INFO L87 Difference]: Start difference. First operand 1496 states and 1873 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:50,786 INFO L93 Difference]: Finished difference Result 1478 states and 1848 transitions. [2025-01-10 00:24:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:50,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 00:24:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:50,790 INFO L225 Difference]: With dead ends: 1478 [2025-01-10 00:24:50,791 INFO L226 Difference]: Without dead ends: 1478 [2025-01-10 00:24:50,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:50,791 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 41 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:50,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4001 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-10 00:24:50,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1475. [2025-01-10 00:24:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 991 states have (on average 1.829465186680121) internal successors, (1813), 1466 states have internal predecessors, (1813), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1845 transitions. [2025-01-10 00:24:50,811 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1845 transitions. Word has length 12 [2025-01-10 00:24:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:50,811 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1845 transitions. [2025-01-10 00:24:50,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1845 transitions. [2025-01-10 00:24:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 00:24:50,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:50,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:24:50,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash -438990787, now seen corresponding path program 1 times [2025-01-10 00:24:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330900827] [2025-01-10 00:24:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:24:50,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:24:50,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:50,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:50,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330900827] [2025-01-10 00:24:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330900827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:50,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104717442] [2025-01-10 00:24:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:50,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:50,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:50,979 INFO L87 Difference]: Start difference. First operand 1475 states and 1845 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:51,774 INFO L93 Difference]: Finished difference Result 1672 states and 1936 transitions. [2025-01-10 00:24:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:24:51,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-10 00:24:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:51,779 INFO L225 Difference]: With dead ends: 1672 [2025-01-10 00:24:51,779 INFO L226 Difference]: Without dead ends: 1672 [2025-01-10 00:24:51,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:51,780 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 822 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:51,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2580 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:24:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-01-10 00:24:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1471. [2025-01-10 00:24:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 991 states have (on average 1.8254288597376387) internal successors, (1809), 1462 states have internal predecessors, (1809), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1841 transitions. [2025-01-10 00:24:51,802 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1841 transitions. Word has length 26 [2025-01-10 00:24:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:51,803 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1841 transitions. [2025-01-10 00:24:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1841 transitions. [2025-01-10 00:24:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 00:24:51,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:51,805 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] [2025-01-10 00:24:51,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:24:51,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:51,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -54962925, now seen corresponding path program 1 times [2025-01-10 00:24:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:51,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784261188] [2025-01-10 00:24:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:51,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 00:24:51,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 00:24:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:51,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784261188] [2025-01-10 00:24:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784261188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:51,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241617825] [2025-01-10 00:24:51,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:51,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:24:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:51,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:24:51,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:24:51,904 INFO L87 Difference]: Start difference. First operand 1471 states and 1841 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:51,947 INFO L93 Difference]: Finished difference Result 1471 states and 1837 transitions. [2025-01-10 00:24:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:24:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2025-01-10 00:24:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:51,951 INFO L225 Difference]: With dead ends: 1471 [2025-01-10 00:24:51,951 INFO L226 Difference]: Without dead ends: 1471 [2025-01-10 00:24:51,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:51,952 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 21 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:51,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3983 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2025-01-10 00:24:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2025-01-10 00:24:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 991 states have (on average 1.8213925327951563) internal successors, (1805), 1462 states have internal predecessors, (1805), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1837 transitions. [2025-01-10 00:24:51,973 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1837 transitions. Word has length 60 [2025-01-10 00:24:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:51,973 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1837 transitions. [2025-01-10 00:24:51,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1837 transitions. [2025-01-10 00:24:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:24:51,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:51,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:51,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:24:51,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 578689375, now seen corresponding path program 1 times [2025-01-10 00:24:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197423879] [2025-01-10 00:24:51,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:51,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 00:24:52,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:24:52,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197423879] [2025-01-10 00:24:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197423879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:24:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572650663] [2025-01-10 00:24:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:52,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:24:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:52,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:24:52,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:52,096 INFO L87 Difference]: Start difference. First operand 1471 states and 1837 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:52,134 INFO L93 Difference]: Finished difference Result 1562 states and 1955 transitions. [2025-01-10 00:24:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:24:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-10 00:24:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:52,139 INFO L225 Difference]: With dead ends: 1562 [2025-01-10 00:24:52,139 INFO L226 Difference]: Without dead ends: 1562 [2025-01-10 00:24:52,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:24:52,140 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 54 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:52,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2677 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:24:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-01-10 00:24:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1562. [2025-01-10 00:24:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1082 states have (on average 1.777264325323475) internal successors, (1923), 1553 states have internal predecessors, (1923), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1955 transitions. [2025-01-10 00:24:52,161 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1955 transitions. Word has length 68 [2025-01-10 00:24:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:52,161 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 1955 transitions. [2025-01-10 00:24:52,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1955 transitions. [2025-01-10 00:24:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 00:24:52,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:52,161 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] [2025-01-10 00:24:52,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:24:52,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -372619202, now seen corresponding path program 1 times [2025-01-10 00:24:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967954099] [2025-01-10 00:24:52,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:52,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 00:24:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 00:24:52,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:52,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:52,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967954099] [2025-01-10 00:24:52,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967954099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:52,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:52,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:24:52,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448878160] [2025-01-10 00:24:52,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:52,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:24:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:52,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:24:52,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:24:52,562 INFO L87 Difference]: Start difference. First operand 1562 states and 1955 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:53,396 INFO L93 Difference]: Finished difference Result 1478 states and 1871 transitions. [2025-01-10 00:24:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:24:53,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 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 71 [2025-01-10 00:24:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:53,401 INFO L225 Difference]: With dead ends: 1478 [2025-01-10 00:24:53,401 INFO L226 Difference]: Without dead ends: 1478 [2025-01-10 00:24:53,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:24:53,403 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 2245 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:53,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2251 Valid, 1265 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:24:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-10 00:24:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1206. [2025-01-10 00:24:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 810 states have (on average 1.674074074074074) internal successors, (1356), 1197 states have internal predecessors, (1356), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1388 transitions. [2025-01-10 00:24:53,426 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1388 transitions. Word has length 71 [2025-01-10 00:24:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:53,427 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1388 transitions. [2025-01-10 00:24:53,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1388 transitions. [2025-01-10 00:24:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:24:53,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:53,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:53,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:24:53,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash 176630386, now seen corresponding path program 1 times [2025-01-10 00:24:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379275245] [2025-01-10 00:24:53,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:53,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:24:53,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:24:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:53,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:53,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379275245] [2025-01-10 00:24:53,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379275245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:53,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:53,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963410275] [2025-01-10 00:24:53,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:53,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:24:53,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:53,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:24:53,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:53,630 INFO L87 Difference]: Start difference. First operand 1206 states and 1388 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:54,440 INFO L93 Difference]: Finished difference Result 1205 states and 1387 transitions. [2025-01-10 00:24:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:24:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:54,444 INFO L225 Difference]: With dead ends: 1205 [2025-01-10 00:24:54,444 INFO L226 Difference]: Without dead ends: 1205 [2025-01-10 00:24:54,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:54,444 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 2 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3596 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:54,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3596 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:24:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-01-10 00:24:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2025-01-10 00:24:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 810 states have (on average 1.6728395061728396) internal successors, (1355), 1196 states have internal predecessors, (1355), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1387 transitions. [2025-01-10 00:24:54,461 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1387 transitions. Word has length 76 [2025-01-10 00:24:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:54,462 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1387 transitions. [2025-01-10 00:24:54,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1387 transitions. [2025-01-10 00:24:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 00:24:54,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:54,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:24:54,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 176630387, now seen corresponding path program 1 times [2025-01-10 00:24:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103369742] [2025-01-10 00:24:54,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:54,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 00:24:54,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 00:24:54,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:54,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103369742] [2025-01-10 00:24:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103369742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:24:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006715260] [2025-01-10 00:24:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:24:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:24:54,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:24:54,815 INFO L87 Difference]: Start difference. First operand 1205 states and 1387 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:55,562 INFO L93 Difference]: Finished difference Result 1204 states and 1386 transitions. [2025-01-10 00:24:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-10 00:24:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:55,566 INFO L225 Difference]: With dead ends: 1204 [2025-01-10 00:24:55,566 INFO L226 Difference]: Without dead ends: 1204 [2025-01-10 00:24:55,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:55,566 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 1 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:55,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3611 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:24:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-01-10 00:24:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2025-01-10 00:24:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 809 states have (on average 1.6736711990111248) internal successors, (1354), 1195 states have internal predecessors, (1354), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:24:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1386 transitions. [2025-01-10 00:24:55,587 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1386 transitions. Word has length 76 [2025-01-10 00:24:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:55,587 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1386 transitions. [2025-01-10 00:24:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:24:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1386 transitions. [2025-01-10 00:24:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:24:55,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:55,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:55,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:24:55,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:55,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1316872455, now seen corresponding path program 1 times [2025-01-10 00:24:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609753188] [2025-01-10 00:24:55,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:24:55,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:24:55,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:55,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609753188] [2025-01-10 00:24:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609753188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:24:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70435579] [2025-01-10 00:24:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:55,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:24:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:55,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:24:55,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:24:55,755 INFO L87 Difference]: Start difference. First operand 1204 states and 1386 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:56,834 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-01-10 00:24:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:24:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-01-10 00:24:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:56,838 INFO L225 Difference]: With dead ends: 1216 [2025-01-10 00:24:56,838 INFO L226 Difference]: Without dead ends: 1216 [2025-01-10 00:24:56,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:24:56,838 INFO L435 NwaCegarLoop]: 1247 mSDtfsCounter, 12 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5555 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5555 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 00:24:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-10 00:24:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1210. [2025-01-10 00:24:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 814 states have (on average 1.671990171990172) internal successors, (1361), 1200 states have internal predecessors, (1361), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-01-10 00:24:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1399 transitions. [2025-01-10 00:24:56,851 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1399 transitions. Word has length 84 [2025-01-10 00:24:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:56,851 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1399 transitions. [2025-01-10 00:24:56,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1399 transitions. [2025-01-10 00:24:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 00:24:56,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:56,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:56,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:24:56,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:56,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1316872454, now seen corresponding path program 1 times [2025-01-10 00:24:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:56,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585509371] [2025-01-10 00:24:56,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:56,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 00:24:56,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 00:24:56,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:57,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:57,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585509371] [2025-01-10 00:24:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585509371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:24:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:24:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:24:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699078364] [2025-01-10 00:24:57,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:24:57,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:24:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:57,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:24:57,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:24:57,194 INFO L87 Difference]: Start difference. First operand 1210 states and 1399 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:24:58,173 INFO L93 Difference]: Finished difference Result 1210 states and 1398 transitions. [2025-01-10 00:24:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:24:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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 84 [2025-01-10 00:24:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:24:58,177 INFO L225 Difference]: With dead ends: 1210 [2025-01-10 00:24:58,177 INFO L226 Difference]: Without dead ends: 1210 [2025-01-10 00:24:58,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:24:58,177 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 7 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4578 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:24:58,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4578 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:24:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-01-10 00:24:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2025-01-10 00:24:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 814 states have (on average 1.6707616707616708) internal successors, (1360), 1200 states have internal predecessors, (1360), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-01-10 00:24:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1398 transitions. [2025-01-10 00:24:58,191 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1398 transitions. Word has length 84 [2025-01-10 00:24:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:24:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1398 transitions. [2025-01-10 00:24:58,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 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:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1398 transitions. [2025-01-10 00:24:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:24:58,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:24:58,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:24:58,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:24:58,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:24:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:24:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2005444881, now seen corresponding path program 1 times [2025-01-10 00:24:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:24:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036768408] [2025-01-10 00:24:58,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:24:58,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:24:58,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:24:58,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:58,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:58,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:24:58,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036768408] [2025-01-10 00:24:58,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036768408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:58,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717980403] [2025-01-10 00:24:58,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:24:58,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:24:58,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:24:58,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:24:58,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:24:58,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:24:58,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:24:58,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:24:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:24:58,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 00:24:58,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:24:58,852 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:24:58,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:24:58,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:24:58,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:24:59,107 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:24:59,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:24:59,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:24:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:24:59,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:24:59,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:24:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717980403] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:24:59,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:24:59,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-01-10 00:24:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702990881] [2025-01-10 00:24:59,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:24:59,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 00:24:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:24:59,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 00:24:59,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-01-10 00:24:59,208 INFO L87 Difference]: Start difference. First operand 1210 states and 1398 transitions. Second operand has 19 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:02,214 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-01-10 00:25:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:02,215 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 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 85 [2025-01-10 00:25:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:02,218 INFO L225 Difference]: With dead ends: 1217 [2025-01-10 00:25:02,218 INFO L226 Difference]: Without dead ends: 1217 [2025-01-10 00:25:02,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2025-01-10 00:25:02,218 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1162 mSDsluCounter, 9580 mSDsCounter, 0 mSdLazyCounter, 7326 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 10353 SdHoareTripleChecker+Invalid, 7358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:02,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 10353 Invalid, 7358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 7326 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 00:25:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-01-10 00:25:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1214. [2025-01-10 00:25:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 818 states have (on average 1.667481662591687) internal successors, (1364), 1203 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1397 transitions. [2025-01-10 00:25:02,239 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1397 transitions. Word has length 85 [2025-01-10 00:25:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1397 transitions. [2025-01-10 00:25:02,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1397 transitions. [2025-01-10 00:25:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 00:25:02,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:02,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:02,247 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:25:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 00:25:02,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:02,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2005444880, now seen corresponding path program 1 times [2025-01-10 00:25:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82843757] [2025-01-10 00:25:02,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:02,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:25:02,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:25:02,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:02,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82843757] [2025-01-10 00:25:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82843757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255243643] [2025-01-10 00:25:02,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:02,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:02,925 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:25:02,927 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:25:03,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 00:25:03,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 00:25:03,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:03,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:03,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 00:25:03,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:03,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:03,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:25:03,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:03,191 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:25:03,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:03,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:03,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:03,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:03,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:03,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:03,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:03,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:03,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:25:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255243643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:03,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:03,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-01-10 00:25:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149640495] [2025-01-10 00:25:03,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:03,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:25:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:03,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:25:03,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-01-10 00:25:03,430 INFO L87 Difference]: Start difference. First operand 1214 states and 1397 transitions. Second operand has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:06,321 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2025-01-10 00:25:06,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:25:06,321 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 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 85 [2025-01-10 00:25:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:06,324 INFO L225 Difference]: With dead ends: 1216 [2025-01-10 00:25:06,324 INFO L226 Difference]: Without dead ends: 1216 [2025-01-10 00:25:06,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-01-10 00:25:06,325 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1180 mSDsluCounter, 5603 mSDsCounter, 0 mSdLazyCounter, 6229 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 6382 SdHoareTripleChecker+Invalid, 6263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:06,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 6382 Invalid, 6263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 6229 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-10 00:25:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-10 00:25:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1207. [2025-01-10 00:25:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 813 states have (on average 1.6691266912669127) internal successors, (1357), 1197 states have internal predecessors, (1357), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:25:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1389 transitions. [2025-01-10 00:25:06,338 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1389 transitions. Word has length 85 [2025-01-10 00:25:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:06,338 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1389 transitions. [2025-01-10 00:25:06,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1389 transitions. [2025-01-10 00:25:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:25:06,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:06,339 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] [2025-01-10 00:25:06,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:25:06,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 00:25:06,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:06,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash -715426427, now seen corresponding path program 1 times [2025-01-10 00:25:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983700880] [2025-01-10 00:25:06,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:06,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:25:06,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:25:06,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:06,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983700880] [2025-01-10 00:25:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983700880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 00:25:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168287070] [2025-01-10 00:25:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:25:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:06,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:25:06,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:25:06,888 INFO L87 Difference]: Start difference. First operand 1207 states and 1389 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:08,241 INFO L93 Difference]: Finished difference Result 1220 states and 1408 transitions. [2025-01-10 00:25:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:25:08,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 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 87 [2025-01-10 00:25:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:08,244 INFO L225 Difference]: With dead ends: 1220 [2025-01-10 00:25:08,244 INFO L226 Difference]: Without dead ends: 1220 [2025-01-10 00:25:08,244 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:25:08,244 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1172 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 3676 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 5213 SdHoareTripleChecker+Invalid, 3707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:08,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 5213 Invalid, 3707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3676 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 00:25:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-01-10 00:25:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1216. [2025-01-10 00:25:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 821 states have (on average 1.6650426309378807) internal successors, (1367), 1205 states have internal predecessors, (1367), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1400 transitions. [2025-01-10 00:25:08,255 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1400 transitions. Word has length 87 [2025-01-10 00:25:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1400 transitions. [2025-01-10 00:25:08,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1400 transitions. [2025-01-10 00:25:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 00:25:08,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:08,256 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] [2025-01-10 00:25:08,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:25:08,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:08,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -715426426, now seen corresponding path program 1 times [2025-01-10 00:25:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309119825] [2025-01-10 00:25:08,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:08,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 00:25:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 00:25:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309119825] [2025-01-10 00:25:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309119825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:08,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:25:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897623724] [2025-01-10 00:25:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:25:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:08,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:25:08,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:25:08,690 INFO L87 Difference]: Start difference. First operand 1216 states and 1400 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:10,667 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2025-01-10 00:25:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:25:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 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 87 [2025-01-10 00:25:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:10,670 INFO L225 Difference]: With dead ends: 1219 [2025-01-10 00:25:10,670 INFO L226 Difference]: Without dead ends: 1219 [2025-01-10 00:25:10,670 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:25:10,670 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 1166 mSDsluCounter, 4309 mSDsCounter, 0 mSdLazyCounter, 5018 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5089 SdHoareTripleChecker+Invalid, 5047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:10,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5089 Invalid, 5047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5018 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 00:25:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-01-10 00:25:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1216. [2025-01-10 00:25:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 821 states have (on average 1.6638246041412912) internal successors, (1366), 1205 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1399 transitions. [2025-01-10 00:25:10,689 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1399 transitions. Word has length 87 [2025-01-10 00:25:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:10,690 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1399 transitions. [2025-01-10 00:25:10,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1399 transitions. [2025-01-10 00:25:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:25:10,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:10,691 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:25:10,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:25:10,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:10,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1212763697, now seen corresponding path program 1 times [2025-01-10 00:25:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:10,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809349055] [2025-01-10 00:25:10,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:10,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:10,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:10,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:10,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809349055] [2025-01-10 00:25:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809349055] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727923084] [2025-01-10 00:25:10,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:10,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:10,996 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:25:10,998 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:25:11,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:11,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:11,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:11,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:11,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:25:11,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:11,257 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:25:11,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:25:11,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:11,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:11,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:11,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:11,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:11,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:11,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:11,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (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_876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:25:11,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_879 (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~mem50#1.base| v_ArrVal_879))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_876)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727923084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:11,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:11,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2025-01-10 00:25:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045295938] [2025-01-10 00:25:11,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:11,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:25:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:11,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:25:11,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=353, Unknown=6, NotChecked=78, Total=506 [2025-01-10 00:25:11,583 INFO L87 Difference]: Start difference. First operand 1216 states and 1399 transitions. Second operand has 20 states, 17 states have (on average 6.823529411764706) internal successors, (116), 20 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:13,611 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2025-01-10 00:25:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:25:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.823529411764706) internal successors, (116), 20 states have internal predecessors, (116), 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 88 [2025-01-10 00:25:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:13,614 INFO L225 Difference]: With dead ends: 1218 [2025-01-10 00:25:13,614 INFO L226 Difference]: Without dead ends: 1218 [2025-01-10 00:25:13,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=387, Unknown=6, NotChecked=82, Total=552 [2025-01-10 00:25:13,615 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 1153 mSDsluCounter, 7377 mSDsCounter, 0 mSdLazyCounter, 5725 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 8155 SdHoareTripleChecker+Invalid, 5754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:13,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 8155 Invalid, 5754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5725 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-10 00:25:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-01-10 00:25:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1215. [2025-01-10 00:25:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 821 states have (on average 1.6626065773447016) internal successors, (1365), 1204 states have internal predecessors, (1365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1398 transitions. [2025-01-10 00:25:13,625 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1398 transitions. Word has length 88 [2025-01-10 00:25:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:13,625 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1398 transitions. [2025-01-10 00:25:13,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.823529411764706) internal successors, (116), 20 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1398 transitions. [2025-01-10 00:25:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 00:25:13,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:13,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:13,633 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:25:13,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:13,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:13,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1212763696, now seen corresponding path program 1 times [2025-01-10 00:25:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:13,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811206876] [2025-01-10 00:25:13,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:13,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:13,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:13,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811206876] [2025-01-10 00:25:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811206876] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856969511] [2025-01-10 00:25:14,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:14,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:14,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:14,281 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:25:14,283 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:25:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 00:25:14,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 00:25:14,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:14,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:14,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 00:25:14,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:14,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:14,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:25:14,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:14,539 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:25:14,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:14,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:14,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:14,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:14,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:14,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:14,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:14,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:14,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:14,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:14,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:14,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:14,775 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-01-10 00:25:14,787 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)) (v_ArrVal_1014 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1014 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2025-01-10 00:25:14,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1021) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (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~mem50#1.base| v_ArrVal_1020))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1021) .cse1 v_ArrVal_1014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:25:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856969511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:14,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2025-01-10 00:25:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665849036] [2025-01-10 00:25:14,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:14,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:25:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:14,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:25:14,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2025-01-10 00:25:14,830 INFO L87 Difference]: Start difference. First operand 1215 states and 1398 transitions. Second operand has 16 states, 14 states have (on average 7.714285714285714) internal successors, (108), 16 states have internal predecessors, (108), 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:25:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:17,245 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2025-01-10 00:25:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:25:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.714285714285714) internal successors, (108), 16 states have internal predecessors, (108), 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 88 [2025-01-10 00:25:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:17,248 INFO L225 Difference]: With dead ends: 1217 [2025-01-10 00:25:17,248 INFO L226 Difference]: Without dead ends: 1217 [2025-01-10 00:25:17,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 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:25:17,249 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 1184 mSDsluCounter, 5007 mSDsCounter, 0 mSdLazyCounter, 5516 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 5563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 5516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:17,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 5785 Invalid, 5563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 5516 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-10 00:25:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-01-10 00:25:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1205. [2025-01-10 00:25:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 813 states have (on average 1.6666666666666667) internal successors, (1355), 1195 states have internal predecessors, (1355), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:25:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1387 transitions. [2025-01-10 00:25:17,264 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1387 transitions. Word has length 88 [2025-01-10 00:25:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:17,266 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1387 transitions. [2025-01-10 00:25:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.714285714285714) internal successors, (108), 16 states have internal predecessors, (108), 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:25:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1387 transitions. [2025-01-10 00:25:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:25:17,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:17,267 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] [2025-01-10 00:25:17,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:25:17,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:17,468 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:17,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1640358240, now seen corresponding path program 1 times [2025-01-10 00:25:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278870987] [2025-01-10 00:25:17,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:25:17,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:25:17,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:17,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:17,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278870987] [2025-01-10 00:25:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278870987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:17,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:17,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-10 00:25:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695284710] [2025-01-10 00:25:17,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:17,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 00:25:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:17,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 00:25:17,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 00:25:17,806 INFO L87 Difference]: Start difference. First operand 1205 states and 1387 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:19,605 INFO L93 Difference]: Finished difference Result 1221 states and 1409 transitions. [2025-01-10 00:25:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:19,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 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 90 [2025-01-10 00:25:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:19,608 INFO L225 Difference]: With dead ends: 1221 [2025-01-10 00:25:19,608 INFO L226 Difference]: Without dead ends: 1221 [2025-01-10 00:25:19,608 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:25:19,608 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1192 mSDsluCounter, 6640 mSDsCounter, 0 mSdLazyCounter, 5218 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 7412 SdHoareTripleChecker+Invalid, 5249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:19,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 7412 Invalid, 5249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5218 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-10 00:25:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-01-10 00:25:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1217. [2025-01-10 00:25:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 824 states have (on average 1.6601941747572815) internal successors, (1368), 1206 states have internal predecessors, (1368), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1401 transitions. [2025-01-10 00:25:19,627 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1401 transitions. Word has length 90 [2025-01-10 00:25:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:19,627 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1401 transitions. [2025-01-10 00:25:19,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1401 transitions. [2025-01-10 00:25:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 00:25:19,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:19,628 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] [2025-01-10 00:25:19,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:25:19,629 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:19,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1640358239, now seen corresponding path program 1 times [2025-01-10 00:25:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:19,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107497820] [2025-01-10 00:25:19,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:19,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 00:25:19,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 00:25:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:20,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:20,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107497820] [2025-01-10 00:25:20,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107497820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:20,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:20,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:25:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725232268] [2025-01-10 00:25:20,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:20,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:25:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:20,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:25:20,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:25:20,129 INFO L87 Difference]: Start difference. First operand 1217 states and 1401 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:22,038 INFO L93 Difference]: Finished difference Result 1220 states and 1408 transitions. [2025-01-10 00:25:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:25:22,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 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 90 [2025-01-10 00:25:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:22,040 INFO L225 Difference]: With dead ends: 1220 [2025-01-10 00:25:22,040 INFO L226 Difference]: Without dead ends: 1220 [2025-01-10 00:25:22,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:25:22,042 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1168 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 4848 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 5232 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:22,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 5232 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4848 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:25:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-01-10 00:25:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2025-01-10 00:25:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 824 states have (on average 1.6589805825242718) internal successors, (1367), 1206 states have internal predecessors, (1367), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1400 transitions. [2025-01-10 00:25:22,056 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1400 transitions. Word has length 90 [2025-01-10 00:25:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:22,056 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1400 transitions. [2025-01-10 00:25:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1400 transitions. [2025-01-10 00:25:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:25:22,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:22,058 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:25:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:25:22,058 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:22,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash -177797610, now seen corresponding path program 1 times [2025-01-10 00:25:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563313001] [2025-01-10 00:25:22,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:22,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:22,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:22,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:22,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563313001] [2025-01-10 00:25:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563313001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784500228] [2025-01-10 00:25:22,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:22,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:22,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:22,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:22,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:25:22,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:22,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:22,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:22,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:22,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:25:22,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:22,691 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:25:22,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:25:22,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:22,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:25:22,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:22,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:25:23,018 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:23,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:23,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:23,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:23,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:23,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:23,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-01-10 00:25:23,089 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:25:23,097 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~mem52#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:25:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784500228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:23,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:23,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2025-01-10 00:25:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293208270] [2025-01-10 00:25:23,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:25:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:23,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:25:23,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=537, Unknown=25, NotChecked=150, Total=812 [2025-01-10 00:25:23,175 INFO L87 Difference]: Start difference. First operand 1217 states and 1400 transitions. Second operand has 24 states, 21 states have (on average 5.809523809523809) internal successors, (122), 23 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:25,145 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2025-01-10 00:25:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:25:25,145 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.809523809523809) internal successors, (122), 23 states have internal predecessors, (122), 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 91 [2025-01-10 00:25:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:25,147 INFO L225 Difference]: With dead ends: 1219 [2025-01-10 00:25:25,147 INFO L226 Difference]: Without dead ends: 1219 [2025-01-10 00:25:25,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=676, Unknown=26, NotChecked=168, Total=992 [2025-01-10 00:25:25,148 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1156 mSDsluCounter, 6623 mSDsCounter, 0 mSdLazyCounter, 5227 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 7394 SdHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:25,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 7394 Invalid, 5261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 5227 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-10 00:25:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-01-10 00:25:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1216. [2025-01-10 00:25:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 824 states have (on average 1.6577669902912622) internal successors, (1366), 1205 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1399 transitions. [2025-01-10 00:25:25,161 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1399 transitions. Word has length 91 [2025-01-10 00:25:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:25,161 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1399 transitions. [2025-01-10 00:25:25,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.809523809523809) internal successors, (122), 23 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1399 transitions. [2025-01-10 00:25:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 00:25:25,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:25,162 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:25:25,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:25:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:25:25,362 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:25,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -177797609, now seen corresponding path program 1 times [2025-01-10 00:25:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107638187] [2025-01-10 00:25:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:25,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:25,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:25,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:25,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107638187] [2025-01-10 00:25:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107638187] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424409800] [2025-01-10 00:25:25,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:25,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:25,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:25,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:25:26,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 00:25:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 00:25:26,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:26,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:26,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 00:25:26,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:26,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:26,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:25:26,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:25:26,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:26,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:26,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:26,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:26,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:26,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:26,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:26,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:26,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:26,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:26,432 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 41 treesize of output 22 [2025-01-10 00:25:26,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:26,486 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 30 treesize of output 12 [2025-01-10 00:25:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:26,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:26,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1444))) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1445))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store .cse0 .cse1 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))) (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1444))) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) 0)))))) is different from false [2025-01-10 00:25:26,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1444))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| .cse2 v_ArrVal_1444))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_1445))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse3 .cse4 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2025-01-10 00:25:26,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1453))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1452) .cse3 v_ArrVal_1444))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1453))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1452) .cse8 v_ArrVal_1444))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1445))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse4 .cse5 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2025-01-10 00:25:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424409800] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:26,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-01-10 00:25:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860186546] [2025-01-10 00:25:26,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:26,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 00:25:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 00:25:26,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=610, Unknown=3, NotChecked=156, Total=870 [2025-01-10 00:25:26,717 INFO L87 Difference]: Start difference. First operand 1216 states and 1399 transitions. Second operand has 23 states, 20 states have (on average 6.1) internal successors, (122), 23 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:30,325 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2025-01-10 00:25:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:25:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.1) internal successors, (122), 23 states have internal predecessors, (122), 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 91 [2025-01-10 00:25:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:30,327 INFO L225 Difference]: With dead ends: 1218 [2025-01-10 00:25:30,328 INFO L226 Difference]: Without dead ends: 1218 [2025-01-10 00:25:30,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=900, Unknown=3, NotChecked=192, Total=1260 [2025-01-10 00:25:30,328 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1183 mSDsluCounter, 7709 mSDsCounter, 0 mSdLazyCounter, 9200 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 8486 SdHoareTripleChecker+Invalid, 9249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 9200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:30,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 8486 Invalid, 9249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 9200 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-10 00:25:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-01-10 00:25:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1203. [2025-01-10 00:25:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 813 states have (on average 1.6642066420664208) internal successors, (1353), 1193 states have internal predecessors, (1353), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:25:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1385 transitions. [2025-01-10 00:25:30,338 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1385 transitions. Word has length 91 [2025-01-10 00:25:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:30,338 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1385 transitions. [2025-01-10 00:25:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.1) internal successors, (122), 23 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1385 transitions. [2025-01-10 00:25:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:25:30,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:30,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:30,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:25:30,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:25:30,540 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash 226178764, now seen corresponding path program 1 times [2025-01-10 00:25:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469889624] [2025-01-10 00:25:30,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:30,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:25:30,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:25:30,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:30,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469889624] [2025-01-10 00:25:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469889624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-10 00:25:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302111796] [2025-01-10 00:25:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 00:25:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:30,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 00:25:30,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:25:30,918 INFO L87 Difference]: Start difference. First operand 1203 states and 1385 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:32,650 INFO L93 Difference]: Finished difference Result 1222 states and 1410 transitions. [2025-01-10 00:25:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:25:32,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 00:25:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:32,653 INFO L225 Difference]: With dead ends: 1222 [2025-01-10 00:25:32,653 INFO L226 Difference]: Without dead ends: 1222 [2025-01-10 00:25:32,653 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:25:32,653 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 1193 mSDsluCounter, 6635 mSDsCounter, 0 mSdLazyCounter, 5219 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 7406 SdHoareTripleChecker+Invalid, 5250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:32,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 7406 Invalid, 5250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5219 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:25:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-01-10 00:25:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1218. [2025-01-10 00:25:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 827 states have (on average 1.6553808948004838) internal successors, (1369), 1207 states have internal predecessors, (1369), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1402 transitions. [2025-01-10 00:25:32,662 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1402 transitions. Word has length 93 [2025-01-10 00:25:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:32,662 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1402 transitions. [2025-01-10 00:25:32,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1402 transitions. [2025-01-10 00:25:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 00:25:32,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:32,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:32,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:25:32,663 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:32,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 226178765, now seen corresponding path program 1 times [2025-01-10 00:25:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:32,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789203528] [2025-01-10 00:25:32,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:32,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 00:25:32,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 00:25:32,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:32,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:33,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:33,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789203528] [2025-01-10 00:25:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789203528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:25:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073595264] [2025-01-10 00:25:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:33,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:25:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:33,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:25:33,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:25:33,174 INFO L87 Difference]: Start difference. First operand 1218 states and 1402 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:35,373 INFO L93 Difference]: Finished difference Result 1221 states and 1409 transitions. [2025-01-10 00:25:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:25:35,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 00:25:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:35,375 INFO L225 Difference]: With dead ends: 1221 [2025-01-10 00:25:35,375 INFO L226 Difference]: Without dead ends: 1221 [2025-01-10 00:25:35,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 00:25:35,375 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 1185 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 5700 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 5729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:35,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 5653 Invalid, 5729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5700 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-10 00:25:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-01-10 00:25:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1218. [2025-01-10 00:25:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 827 states have (on average 1.6541717049576783) internal successors, (1368), 1207 states have internal predecessors, (1368), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1401 transitions. [2025-01-10 00:25:35,384 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1401 transitions. Word has length 93 [2025-01-10 00:25:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:35,384 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1401 transitions. [2025-01-10 00:25:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:25:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1401 transitions. [2025-01-10 00:25:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:25:35,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:35,384 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:25:35,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:25:35,385 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:35,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1073310826, now seen corresponding path program 1 times [2025-01-10 00:25:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261862277] [2025-01-10 00:25:35,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:25:35,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:25:35,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:35,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:35,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261862277] [2025-01-10 00:25:35,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261862277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936451675] [2025-01-10 00:25:35,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:35,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:35,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:35,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:35,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:25:35,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:25:35,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:25:35,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:35,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:35,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 00:25:35,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:36,019 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:25:36,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:25:36,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:36,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:36,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:36,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:36,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:36,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:36,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:36,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:36,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:36,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:36,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:36,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:36,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1751 (Array Int Int)) (v_ArrVal_1750 (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_1750))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1751)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:36,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1751 (Array Int Int)) (v_ArrVal_1750 (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| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1751)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:36,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1751 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_ArrVal_1749 (Array Int Int))) (= 1 (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~mem52#1.base| v_ArrVal_1749))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1751)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2025-01-10 00:25:40,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1751 (Array Int Int)) (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1754))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1749)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1750)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1751)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:25:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936451675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:40,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2025-01-10 00:25:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240437293] [2025-01-10 00:25:40,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 00:25:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 00:25:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=631, Unknown=18, NotChecked=220, Total=992 [2025-01-10 00:25:40,528 INFO L87 Difference]: Start difference. First operand 1218 states and 1401 transitions. Second operand has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 25 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:43,331 INFO L93 Difference]: Finished difference Result 1220 states and 1408 transitions. [2025-01-10 00:25:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:25:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 25 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-01-10 00:25:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:43,333 INFO L225 Difference]: With dead ends: 1220 [2025-01-10 00:25:43,333 INFO L226 Difference]: Without dead ends: 1220 [2025-01-10 00:25:43,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=134, Invalid=676, Unknown=18, NotChecked=228, Total=1056 [2025-01-10 00:25:43,334 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1145 mSDsluCounter, 7349 mSDsCounter, 0 mSdLazyCounter, 5740 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 8125 SdHoareTripleChecker+Invalid, 5769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:43,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 8125 Invalid, 5769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5740 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:25:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-01-10 00:25:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2025-01-10 00:25:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 827 states have (on average 1.652962515114873) internal successors, (1367), 1206 states have internal predecessors, (1367), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1400 transitions. [2025-01-10 00:25:43,342 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1400 transitions. Word has length 94 [2025-01-10 00:25:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:43,343 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1400 transitions. [2025-01-10 00:25:43,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.818181818181818) internal successors, (128), 25 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1400 transitions. [2025-01-10 00:25:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 00:25:43,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:43,343 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:25:43,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:25:43,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:43,544 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:43,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1073310825, now seen corresponding path program 1 times [2025-01-10 00:25:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726536801] [2025-01-10 00:25:43,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:43,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:43,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:25:43,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:25:43,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:43,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726536801] [2025-01-10 00:25:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726536801] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969474808] [2025-01-10 00:25:44,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:44,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:44,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:44,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:25:44,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:25:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 00:25:44,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 00:25:44,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:44,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:44,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 00:25:44,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:44,344 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:25:44,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:25:44,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:25:44,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:44,383 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:25:44,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:44,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:44,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:44,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:44,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 30 treesize of output 13 [2025-01-10 00:25:44,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:44,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:44,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:44,649 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:44,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:44,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:44,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:44,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:25:44,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:25:44,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:44,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 00:25:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:44,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:44,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#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~mem53#1.base| v_ArrVal_1916) .cse0 v_ArrVal_1918) |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_1918 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1916) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-01-10 00:25:44,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1915))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1916) .cse1 v_ArrVal_1918) |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_1918 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1916) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2025-01-10 00:25:44,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1918 (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~mem52#1.base| v_ArrVal_1914))) (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~mem52#1.base| v_ArrVal_1913) .cse0 v_ArrVal_1916) .cse1 v_ArrVal_1918) |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_1918 (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~mem52#1.base| v_ArrVal_1914))) (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~mem52#1.base| v_ArrVal_1913) .cse5 v_ArrVal_1916) (select (select (store .cse6 .cse5 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1918))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2025-01-10 00:25:44,981 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 (forall ((v_ArrVal_1918 (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 ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1914))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1915))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1913) .cse1 v_ArrVal_1916) .cse2 v_ArrVal_1918) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1918 (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 ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1914))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1913) .cse6 v_ArrVal_1916) (select (select (store .cse7 .cse6 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1918))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-01-10 00:25:45,085 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_1918 (Array Int Int)) (v_ArrVal_1916 (Array Int Int)) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1914 (Array Int Int)) (v_ArrVal_1924 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1924))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1914))) (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~mem50#1.base| v_ArrVal_1923) .cse0 v_ArrVal_1913) .cse1 v_ArrVal_1916) (select (select (store .cse2 .cse1 v_ArrVal_1915) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1918))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1918 (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_1924 (Array Int Int)) (v_ArrVal_1913 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1924))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1914))) (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~mem50#1.base| v_ArrVal_1923) .cse5 v_ArrVal_1913) .cse6 v_ArrVal_1916) .cse7 v_ArrVal_1918) |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:25:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969474808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:45,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2025-01-10 00:25:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700616994] [2025-01-10 00:25:45,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:45,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:25:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:45,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:25:45,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=640, Unknown=23, NotChecked=280, Total=1056 [2025-01-10 00:25:45,089 INFO L87 Difference]: Start difference. First operand 1217 states and 1400 transitions. Second operand has 24 states, 21 states have (on average 6.095238095238095) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:48,012 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2025-01-10 00:25:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 00:25:48,013 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.095238095238095) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-01-10 00:25:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:48,014 INFO L225 Difference]: With dead ends: 1219 [2025-01-10 00:25:48,014 INFO L226 Difference]: Without dead ends: 1219 [2025-01-10 00:25:48,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1004, Unknown=23, NotChecked=350, Total=1560 [2025-01-10 00:25:48,015 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1185 mSDsluCounter, 4888 mSDsCounter, 0 mSdLazyCounter, 5758 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 5664 SdHoareTripleChecker+Invalid, 5809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 5758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:48,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 5664 Invalid, 5809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 5758 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:25:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2025-01-10 00:25:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1201. [2025-01-10 00:25:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 813 states have (on average 1.6617466174661746) internal successors, (1351), 1191 states have internal predecessors, (1351), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 00:25:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1383 transitions. [2025-01-10 00:25:48,023 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1383 transitions. Word has length 94 [2025-01-10 00:25:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1383 transitions. [2025-01-10 00:25:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.095238095238095) internal successors, (128), 24 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:25:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1383 transitions. [2025-01-10 00:25:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:25:48,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:48,023 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:25:48,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:25:48,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 00:25:48,224 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:48,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -581955314, now seen corresponding path program 1 times [2025-01-10 00:25:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:48,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781635655] [2025-01-10 00:25:48,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:48,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:25:48,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:25:48,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:48,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:48,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:48,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781635655] [2025-01-10 00:25:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781635655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-10 00:25:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238318827] [2025-01-10 00:25:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:25:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:48,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:25:48,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:25:48,679 INFO L87 Difference]: Start difference. First operand 1201 states and 1383 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 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:25:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:51,771 INFO L93 Difference]: Finished difference Result 1224 states and 1412 transitions. [2025-01-10 00:25:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:25:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 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:25:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:51,773 INFO L225 Difference]: With dead ends: 1224 [2025-01-10 00:25:51,773 INFO L226 Difference]: Without dead ends: 1224 [2025-01-10 00:25:51,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-01-10 00:25:51,773 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 1188 mSDsluCounter, 9507 mSDsCounter, 0 mSdLazyCounter, 7288 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 10277 SdHoareTripleChecker+Invalid, 7320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:51,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 10277 Invalid, 7320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 7288 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 00:25:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-01-10 00:25:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1220. [2025-01-10 00:25:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 831 states have (on average 1.6498194945848375) internal successors, (1371), 1209 states have internal predecessors, (1371), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1404 transitions. [2025-01-10 00:25:51,781 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1404 transitions. Word has length 97 [2025-01-10 00:25:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:51,781 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1404 transitions. [2025-01-10 00:25:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 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:25:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1404 transitions. [2025-01-10 00:25:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 00:25:51,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:51,782 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:25:51,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 00:25:51,782 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -581955313, now seen corresponding path program 1 times [2025-01-10 00:25:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144103047] [2025-01-10 00:25:51,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:51,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 00:25:51,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 00:25:51,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:51,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144103047] [2025-01-10 00:25:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144103047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:25:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:25:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-10 00:25:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200580844] [2025-01-10 00:25:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:25:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:25:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:25:52,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:25:52,483 INFO L87 Difference]: Start difference. First operand 1220 states and 1404 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 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:25:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:25:56,295 INFO L93 Difference]: Finished difference Result 1223 states and 1411 transitions. [2025-01-10 00:25:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:25:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 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:25:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:25:56,297 INFO L225 Difference]: With dead ends: 1223 [2025-01-10 00:25:56,297 INFO L226 Difference]: Without dead ends: 1223 [2025-01-10 00:25:56,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-01-10 00:25:56,298 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 1169 mSDsluCounter, 7570 mSDsCounter, 0 mSdLazyCounter, 8051 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 8340 SdHoareTripleChecker+Invalid, 8084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:25:56,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 8340 Invalid, 8084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 8051 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-10 00:25:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-01-10 00:25:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1220. [2025-01-10 00:25:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 831 states have (on average 1.6486161251504212) internal successors, (1370), 1209 states have internal predecessors, (1370), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:25:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1403 transitions. [2025-01-10 00:25:56,306 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1403 transitions. Word has length 97 [2025-01-10 00:25:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:25:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1403 transitions. [2025-01-10 00:25:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 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:25:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1403 transitions. [2025-01-10 00:25:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:25:56,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:25:56,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:25:56,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 00:25:56,307 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:25:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:25:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1844181208, now seen corresponding path program 1 times [2025-01-10 00:25:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:25:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034317695] [2025-01-10 00:25:56,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:25:56,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:25:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:25:56,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:56,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:56,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:25:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034317695] [2025-01-10 00:25:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034317695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710996454] [2025-01-10 00:25:56,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:25:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:25:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:25:56,787 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:25:56,789 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:25:56,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:25:56,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:25:56,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:25:56,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:25:56,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 00:25:56,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:25:57,059 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:25:57,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 00:25:57,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 00:25:57,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 00:25:57,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:57,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:57,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:57,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:57,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:57,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:57,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:57,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:57,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:25:57,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-10 00:25:57,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-10 00:25:57,502 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-10 00:25:57,503 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:25:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:25:57,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:25:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710996454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:25:58,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 00:25:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2025-01-10 00:25:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332607189] [2025-01-10 00:25:58,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 00:25:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 00:25:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:25:58,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 00:25:58,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1160, Unknown=54, NotChecked=0, Total=1406 [2025-01-10 00:25:58,061 INFO L87 Difference]: Start difference. First operand 1220 states and 1403 transitions. Second operand has 27 states, 24 states have (on average 5.666666666666667) internal successors, (136), 26 states have internal predecessors, (136), 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:26:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:26:01,779 INFO L93 Difference]: Finished difference Result 1222 states and 1410 transitions. [2025-01-10 00:26:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:26:01,779 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.666666666666667) internal successors, (136), 26 states have internal predecessors, (136), 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:26:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:26:01,781 INFO L225 Difference]: With dead ends: 1222 [2025-01-10 00:26:01,781 INFO L226 Difference]: Without dead ends: 1222 [2025-01-10 00:26:01,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1368, Unknown=54, NotChecked=0, Total=1640 [2025-01-10 00:26:01,782 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 1142 mSDsluCounter, 10195 mSDsCounter, 0 mSdLazyCounter, 7892 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 10964 SdHoareTripleChecker+Invalid, 7925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:26:01,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 10964 Invalid, 7925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 7892 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-10 00:26:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-01-10 00:26:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1219. [2025-01-10 00:26:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 831 states have (on average 1.6474127557160048) internal successors, (1369), 1208 states have internal predecessors, (1369), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-10 00:26:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1402 transitions. [2025-01-10 00:26:01,793 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1402 transitions. Word has length 98 [2025-01-10 00:26:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:26:01,794 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1402 transitions. [2025-01-10 00:26:01,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.666666666666667) internal successors, (136), 26 states have internal predecessors, (136), 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:26:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1402 transitions. [2025-01-10 00:26:01,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 00:26:01,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:26:01,794 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:26:01,805 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:26:01,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:26:01,995 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-01-10 00:26:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:26:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1844181209, now seen corresponding path program 1 times [2025-01-10 00:26:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:26:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792595145] [2025-01-10 00:26:01,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:26:02,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:26:02,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:26:02,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:02,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:02,743 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:26:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:26:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792595145] [2025-01-10 00:26:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792595145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:26:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715078363] [2025-01-10 00:26:02,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:26:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:26:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:26:02,746 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:26:02,746 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:26:02,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 00:26:02,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 00:26:02,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:26:02,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:26:02,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-10 00:26:02,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:26:03,015 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:26:03,027 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:26:03,028 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:26:03,059 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:26:03,061 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:26:03,152 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:26:03,156 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:26:03,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:03,309 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:26:03,312 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:26:03,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:03,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 73 treesize of output 66 [2025-01-10 00:26:03,423 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:26:03,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:03,504 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:26:03,511 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:26:03,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:03,578 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:26:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:26:03,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:26:03,650 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:26:03,656 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:26:03,674 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:26:03,678 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:26:03,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:26:03,718 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:26:03,729 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-10 00:26:03,729 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:26:03,756 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:26:03,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:26:04,418 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~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#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_2442 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ (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_2438) .cse1 v_ArrVal_2440) (select (select (store .cse2 .cse1 v_ArrVal_2439) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2442))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (or (forall ((v_ArrVal_2443 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_2439))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2438) .cse4 v_ArrVal_2440) .cse5 v_ArrVal_2442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2443) (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~malloc57#1.base_7|) 0))))))) is different from false [2025-01-10 00:26:04,449 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2442 (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~mem52#1.base| v_ArrVal_2436))) (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~mem52#1.base| v_ArrVal_2435) .cse0 v_ArrVal_2438) .cse1 v_ArrVal_2440) (select (select (store .cse2 .cse1 v_ArrVal_2439) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2442))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#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_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2442 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (or (forall ((v_ArrVal_2443 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2436))) (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_2439))) (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~mem52#1.base| v_ArrVal_2435) .cse5 v_ArrVal_2438) .cse6 v_ArrVal_2440) .cse7 v_ArrVal_2442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2443) (select (select (store .cse8 .cse7 v_ArrVal_2441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false