./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/busybox-1.22.0/sleep-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash d0bc799b191b0f041501848e0b025f1bbbbae14bfc340caf1bcdba3dca73f41a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:42:48,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:42:49,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:42:49,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:42:49,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:42:49,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:42:49,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:42:49,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:42:49,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:42:49,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:42:49,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:42:49,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:42:49,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:42:49,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:42:49,045 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:42:49,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:42:49,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:42:49,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:42:49,045 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:42:49,045 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:42:49,045 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:42:49,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:42:49,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:49,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:42:49,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:42:49,048 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0bc799b191b0f041501848e0b025f1bbbbae14bfc340caf1bcdba3dca73f41a [2025-02-08 07:42:49,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:42:49,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:42:49,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:42:49,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:42:49,326 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:42:49,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sleep-1.i [2025-02-08 07:42:50,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cca6c64a1/eb66b0f7779e48e68d9a54164603d6ec/FLAGd4951ec76 [2025-02-08 07:42:50,952 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:42:50,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-1.i [2025-02-08 07:42:50,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cca6c64a1/eb66b0f7779e48e68d9a54164603d6ec/FLAGd4951ec76 [2025-02-08 07:42:51,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cca6c64a1/eb66b0f7779e48e68d9a54164603d6ec [2025-02-08 07:42:51,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:42:51,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:42:51,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:51,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:42:51,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:42:51,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:51" (1/1) ... [2025-02-08 07:42:51,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2ecfd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:51, skipping insertion in model container [2025-02-08 07:42:51,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:51" (1/1) ... [2025-02-08 07:42:51,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:42:52,121 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,126 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,128 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,130 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,130 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,132 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,135 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,139 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,143 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,143 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,152 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,155 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,161 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,171 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,178 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,185 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:52,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:52,238 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:42:52,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:52,519 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:42:52,525 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:42:52,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52 WrapperNode [2025-02-08 07:42:52,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:52,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:52,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:42:52,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:42:52,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,637 INFO L138 Inliner]: procedures = 633, calls = 576, calls flagged for inlining = 18, calls inlined = 16, statements flattened = 1040 [2025-02-08 07:42:52,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:52,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:42:52,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:42:52,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:42:52,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,683 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:42:52,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:42:52,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:42:52,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:42:52,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:42:52,748 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (1/1) ... [2025-02-08 07:42:52,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:52,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:42:52,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:42:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-02-08 07:42:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:42:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:42:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:42:52,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:42:52,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:42:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:42:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:42:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:42:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 07:42:52,812 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 07:42:52,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:42:53,143 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:42:53,144 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:42:53,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet185#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet185#1;assume -9223372036854775808 <= write_#t~nondet185#1 && write_#t~nondet185#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet185#1;havoc write_#t~nondet185#1; [2025-02-08 07:42:53,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: assume !true; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: full_write_#t~ret103#1 := safe_write_#res#1;havoc safe_write_#t~ret104#1, safe_write_#t~mem105#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret103#1 && full_write_#t~ret103#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret103#1;havoc full_write_#t~ret103#1; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2505-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: assume full_write_~cc~0#1 < 0; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2498: safe_write_#t~ret104#1 := write_#res#1;havoc write_#t~nondet185#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret104#1 && safe_write_#t~ret104#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret104#1;havoc safe_write_#t~ret104#1; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2499: assume safe_write_~n~0#1 < 0; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2499: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:42:53,648 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem105#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:42:53,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500-1: SUMMARY for call safe_write_#t~mem105#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:53,649 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: write_#res#1 := write_~ret~1#1; [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461: bb_verror_msg_#t~ret96#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet102#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret96#1 && bb_verror_msg_#t~ret96#1 <= 2147483647;havoc bb_verror_msg_#t~ret96#1; [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret104#1, safe_write_#t~mem105#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: bb_verror_msg_#t~ret98#1 := full_write_#res#1;havoc full_write_#t~ret103#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret98#1 && bb_verror_msg_#t~ret98#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset;havoc bb_verror_msg_#t~ret98#1; [2025-02-08 07:42:53,650 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-2: SUMMARY for call bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:53,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:53,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:53,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem97#1.base, bb_verror_msg_#t~mem97#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret103#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: call ULTIMATE.dealloc(__main_~#ts~0#1.base, __main_~#ts~0#1.offset);havoc __main_~#ts~0#1.base, __main_~#ts~0#1.offset; [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !(4 == __main_#t~mem122#1);havoc __main_#t~mem122#1; [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !!(4 == __main_#t~mem122#1);havoc __main_#t~mem122#1; [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: SUMMARY for call __main_#t~mem122#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:58,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1;__main_#t~ret121#1 := nanosleep_#res#1;havoc nanosleep_#t~nondet142#1, nanosleep_#t~nondet143#1, nanosleep_#t~nondet144#1, nanosleep_#t~mem145#1, nanosleep_#t~short146#1, nanosleep_#t~mem147#1, nanosleep_#t~short148#1, nanosleep_#t~mem149#1, nanosleep_#t~mem150#1, nanosleep_#t~nondet151#1, nanosleep_#t~mem152#1, nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1, nanosleep_~__requested_time#1.base, nanosleep_~__requested_time#1.offset, nanosleep_~__remaining#1.base, nanosleep_~__remaining#1.offset;havoc nanosleep_#in~__requested_time#1.base, nanosleep_#in~__requested_time#1.offset, nanosleep_#in~__remaining#1.base, nanosleep_#in~__remaining#1.offset;assume { :end_inline_nanosleep } true;assume -2147483648 <= __main_#t~ret121#1 && __main_#t~ret121#1 <= 2147483647;havoc __main_#t~ret121#1; [2025-02-08 07:42:58,502 INFO L? ?]: Removed 491 outVars from TransFormulas that were not future-live. [2025-02-08 07:42:58,502 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:42:58,530 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:42:58,531 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:42:58,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:58 BoogieIcfgContainer [2025-02-08 07:42:58,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:42:58,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:42:58,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:42:58,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:42:58,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:42:51" (1/3) ... [2025-02-08 07:42:58,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce4d92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:58, skipping insertion in model container [2025-02-08 07:42:58,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:52" (2/3) ... [2025-02-08 07:42:58,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce4d92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:58, skipping insertion in model container [2025-02-08 07:42:58,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:58" (3/3) ... [2025-02-08 07:42:58,543 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-1.i [2025-02-08 07:42:58,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:42:58,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-1.i that has 5 procedures, 466 locations, 1 initial locations, 14 loop locations, and 209 error locations. [2025-02-08 07:42:58,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:42:58,628 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;@beb0b60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:42:58,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 209 error locations. [2025-02-08 07:42:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 240 states have (on average 2.0458333333333334) internal successors, (491), 450 states have internal predecessors, (491), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 07:42:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:58,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:58,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:58,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:42:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 15647, now seen corresponding path program 1 times [2025-02-08 07:42:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:58,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067952261] [2025-02-08 07:42:58,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:59,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:59,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:59,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:59,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067952261] [2025-02-08 07:42:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067952261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145029871] [2025-02-08 07:42:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:59,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:59,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:59,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:59,683 INFO L87 Difference]: Start difference. First operand has 466 states, 240 states have (on average 2.0458333333333334) internal successors, (491), 450 states have internal predecessors, (491), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:00,005 INFO L93 Difference]: Finished difference Result 232 states and 248 transitions. [2025-02-08 07:43:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:43:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:00,018 INFO L225 Difference]: With dead ends: 232 [2025-02-08 07:43:00,018 INFO L226 Difference]: Without dead ends: 225 [2025-02-08 07:43:00,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:00,024 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 93 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:00,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 279 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:43:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-08 07:43:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-08 07:43:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 119 states have (on average 1.9747899159663866) internal successors, (235), 220 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 241 transitions. [2025-02-08 07:43:00,078 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 241 transitions. Word has length 2 [2025-02-08 07:43:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:00,079 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 241 transitions. [2025-02-08 07:43:00,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 241 transitions. [2025-02-08 07:43:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:43:00,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:00,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:43:00,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:43:00,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:43:00,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 15648, now seen corresponding path program 1 times [2025-02-08 07:43:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186490507] [2025-02-08 07:43:00,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:00,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:43:00,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:43:00,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:00,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:00,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186490507] [2025-02-08 07:43:00,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186490507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:00,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:43:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187940232] [2025-02-08 07:43:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:00,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:00,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:00,732 INFO L87 Difference]: Start difference. First operand 225 states and 241 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:00,957 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2025-02-08 07:43:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:43:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:00,959 INFO L225 Difference]: With dead ends: 224 [2025-02-08 07:43:00,959 INFO L226 Difference]: Without dead ends: 224 [2025-02-08 07:43:00,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:00,960 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 10 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:00,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 364 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:43:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-08 07:43:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-02-08 07:43:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 119 states have (on average 1.9663865546218486) internal successors, (234), 219 states have internal predecessors, (234), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 240 transitions. [2025-02-08 07:43:00,976 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 240 transitions. Word has length 2 [2025-02-08 07:43:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:00,976 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 240 transitions. [2025-02-08 07:43:00,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 240 transitions. [2025-02-08 07:43:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:43:00,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:00,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:43:00,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:43:00,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:43:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 466561608, now seen corresponding path program 1 times [2025-02-08 07:43:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691042643] [2025-02-08 07:43:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:01,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:43:01,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:43:01,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:01,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:01,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691042643] [2025-02-08 07:43:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691042643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:01,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:43:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705458384] [2025-02-08 07:43:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:01,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:01,404 INFO L87 Difference]: Start difference. First operand 224 states and 240 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:05,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:05,476 INFO L93 Difference]: Finished difference Result 227 states and 244 transitions. [2025-02-08 07:43:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:05,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:43:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:05,478 INFO L225 Difference]: With dead ends: 227 [2025-02-08 07:43:05,478 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 07:43:05,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:05,479 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 2 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:05,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 469 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 07:43:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 07:43:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2025-02-08 07:43:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 120 states have (on average 1.9583333333333333) internal successors, (235), 220 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 241 transitions. [2025-02-08 07:43:05,501 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 241 transitions. Word has length 5 [2025-02-08 07:43:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:05,502 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 241 transitions. [2025-02-08 07:43:05,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 241 transitions. [2025-02-08 07:43:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:43:05,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:05,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:43:05,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:43:05,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:43:05,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:05,504 INFO L85 PathProgramCache]: Analyzing trace with hash 466561768, now seen corresponding path program 1 times [2025-02-08 07:43:05,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:05,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715771833] [2025-02-08 07:43:05,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:05,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:43:05,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:43:05,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:05,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715771833] [2025-02-08 07:43:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715771833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:06,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:06,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:43:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223931666] [2025-02-08 07:43:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:43:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:06,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:43:06,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:43:06,177 INFO L87 Difference]: Start difference. First operand 225 states and 241 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:10,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:10,513 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2025-02-08 07:43:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:43:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:43:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:10,515 INFO L225 Difference]: With dead ends: 227 [2025-02-08 07:43:10,515 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 07:43:10,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:43:10,516 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 10 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:10,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 495 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 07:43:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 07:43:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2025-02-08 07:43:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 121 states have (on average 1.9504132231404958) internal successors, (236), 221 states have internal predecessors, (236), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 242 transitions. [2025-02-08 07:43:10,526 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 242 transitions. Word has length 5 [2025-02-08 07:43:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:10,527 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 242 transitions. [2025-02-08 07:43:10,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 242 transitions. [2025-02-08 07:43:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:43:10,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:10,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:10,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:43:10,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:43:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash 827847867, now seen corresponding path program 1 times [2025-02-08 07:43:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952391280] [2025-02-08 07:43:10,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:10,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:10,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:10,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:10,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952391280] [2025-02-08 07:43:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952391280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188619009] [2025-02-08 07:43:10,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:10,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:10,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:10,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:43:11,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:11,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:11,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:11,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:11,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:43:11,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:11,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188619009] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:11,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:43:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921728253] [2025-02-08 07:43:11,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:11,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:11,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:11,514 INFO L87 Difference]: Start difference. First operand 226 states and 242 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:15,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:19,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:23,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:27,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:31,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:31,619 INFO L93 Difference]: Finished difference Result 234 states and 252 transitions. [2025-02-08 07:43:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:43:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 8 [2025-02-08 07:43:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:31,621 INFO L225 Difference]: With dead ends: 234 [2025-02-08 07:43:31,621 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 07:43:31,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:31,623 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 4 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:31,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 469 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-08 07:43:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 07:43:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-08 07:43:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 129 states have (on average 1.9069767441860466) internal successors, (246), 229 states have internal predecessors, (246), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 252 transitions. [2025-02-08 07:43:31,641 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 252 transitions. Word has length 8 [2025-02-08 07:43:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:31,642 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 252 transitions. [2025-02-08 07:43:31,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 252 transitions. [2025-02-08 07:43:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:43:31,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:31,642 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:31,660 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-02-08 07:43:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:31,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:43:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash 827848027, now seen corresponding path program 1 times [2025-02-08 07:43:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671086481] [2025-02-08 07:43:31,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:32,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:32,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671086481] [2025-02-08 07:43:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671086481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147576212] [2025-02-08 07:43:32,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:32,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:32,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:32,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:32,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:43:32,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:43:32,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:43:32,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:32,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:32,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:43:32,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:33,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:33,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:43:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147576212] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:33,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:43:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979161743] [2025-02-08 07:43:33,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:43:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:33,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:43:33,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:43:33,189 INFO L87 Difference]: Start difference. First operand 234 states and 252 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:43:37,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:41,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:45,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:49,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:53,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:57,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:01,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:01,568 INFO L93 Difference]: Finished difference Result 233 states and 249 transitions. [2025-02-08 07:44:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:44:01,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 8 [2025-02-08 07:44:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:01,570 INFO L225 Difference]: With dead ends: 233 [2025-02-08 07:44:01,570 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 07:44:01,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:44:01,571 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 253 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 6 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:01,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 676 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2025-02-08 07:44:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 07:44:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-02-08 07:44:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 129 states have (on average 1.8837209302325582) internal successors, (243), 228 states have internal predecessors, (243), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 249 transitions. [2025-02-08 07:44:01,578 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 249 transitions. Word has length 8 [2025-02-08 07:44:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:01,578 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 249 transitions. [2025-02-08 07:44:01,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 249 transitions. [2025-02-08 07:44:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:44:01,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:01,579 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:44:01,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:44:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:01,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:44:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1136303992, now seen corresponding path program 2 times [2025-02-08 07:44:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302375323] [2025-02-08 07:44:01,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:44:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:01,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 07:44:01,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 07:44:01,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:44:01,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 07:44:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:02,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302375323] [2025-02-08 07:44:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302375323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:44:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169813624] [2025-02-08 07:44:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:02,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:44:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:44:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:02,371 INFO L87 Difference]: Start difference. First operand 233 states and 249 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:02,529 INFO L93 Difference]: Finished difference Result 232 states and 248 transitions. [2025-02-08 07:44:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:44:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 17 [2025-02-08 07:44:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:02,530 INFO L225 Difference]: With dead ends: 232 [2025-02-08 07:44:02,530 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 07:44:02,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:44:02,531 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 11 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:02,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 368 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:44:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 07:44:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-08 07:44:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 129 states have (on average 1.875968992248062) internal successors, (242), 227 states have internal predecessors, (242), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:44:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 248 transitions. [2025-02-08 07:44:02,537 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 248 transitions. Word has length 17 [2025-02-08 07:44:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 248 transitions. [2025-02-08 07:44:02,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 248 transitions. [2025-02-08 07:44:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:44:02,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:02,538 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:44:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:44:02,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 206 more)] === [2025-02-08 07:44:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1136303993, now seen corresponding path program 1 times [2025-02-08 07:44:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036319883] [2025-02-08 07:44:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:02,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:44:02,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:44:02,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:02,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:02,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036319883] [2025-02-08 07:44:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036319883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:02,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899163686] [2025-02-08 07:44:02,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:02,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:03,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:44:03,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:44:03,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:44:03,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:44:03,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:03,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:03,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:44:03,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:03,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899163686] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:03,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:03,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:44:03,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819622067] [2025-02-08 07:44:03,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:03,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:44:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:03,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:44:03,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:44:03,699 INFO L87 Difference]: Start difference. First operand 232 states and 248 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:07,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:11,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:15,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:19,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:23,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:27,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []