./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-10 00:08:18,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:08:18,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:08:18,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:08:18,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:08:18,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:08:18,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:08:18,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:08:18,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:08:18,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:08:18,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:08:18,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:08:18,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:08:18,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:08:18,768 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:08:18,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:08:18,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:08:18,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:08:18,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:08:18,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:08:18,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:18,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:18,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:08:18,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:08:18,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:08:18,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:08:18,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:08:18,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:08:18,774 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-01-10 00:08:19,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:08:19,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:08:19,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:08:19,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:08:19,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:08:19,175 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-01-10 00:08:20,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79e653a2d/01d67edc149d45ab8b4b1666a4f5ccb0/FLAG59a5edf88 [2025-01-10 00:08:21,132 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:08:21,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-1.i [2025-01-10 00:08:21,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79e653a2d/01d67edc149d45ab8b4b1666a4f5ccb0/FLAG59a5edf88 [2025-01-10 00:08:21,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79e653a2d/01d67edc149d45ab8b4b1666a4f5ccb0 [2025-01-10 00:08:21,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:08:21,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:08:21,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:08:21,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:08:21,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:08:21,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:08:21" (1/1) ... [2025-01-10 00:08:21,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:21, skipping insertion in model container [2025-01-10 00:08:21,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:08:21" (1/1) ... [2025-01-10 00:08:21,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:08:22,435 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,443 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,448 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,448 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,449 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,450 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,450 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,451 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,456 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,457 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,469 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,469 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,486 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,491 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,516 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,529 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,548 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:22,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:08:22,603 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:08:22,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:08:22,938 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:08:22,945 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:08:22,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22 WrapperNode [2025-01-10 00:08:22,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:08:22,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:08:22,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:08:22,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:08:22,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,117 INFO L138 Inliner]: procedures = 633, calls = 576, calls flagged for inlining = 18, calls inlined = 16, statements flattened = 1040 [2025-01-10 00:08:23,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:08:23,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:08:23,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:08:23,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:08:23,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,156 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:08:23,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:08:23,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:08:23,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:08:23,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:08:23,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (1/1) ... [2025-01-10 00:08:23,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:23,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:23,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:08:23,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:08:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:08:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:08:23,359 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-01-10 00:08:23,359 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-01-10 00:08:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:08:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:08:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:08:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:08:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:08:23,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:08:23,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:08:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:08:23,361 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:08:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:08:23,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 00:08:23,362 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 00:08:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:08:23,765 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:08:23,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:08:29,331 INFO L? ?]: Removed 531 outVars from TransFormulas that were not future-live. [2025-01-10 00:08:29,332 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:08:29,363 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:08:29,366 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-10 00:08:29,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:08:29 BoogieIcfgContainer [2025-01-10 00:08:29,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:08:29,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:08:29,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:08:29,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:08:29,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:08:21" (1/3) ... [2025-01-10 00:08:29,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212c6dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:08:29, skipping insertion in model container [2025-01-10 00:08:29,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:22" (2/3) ... [2025-01-10 00:08:29,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212c6dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:08:29, skipping insertion in model container [2025-01-10 00:08:29,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:08:29" (3/3) ... [2025-01-10 00:08:29,384 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-1.i [2025-01-10 00:08:29,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:08:29,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-1.i that has 5 procedures, 490 locations, 1 initial locations, 14 loop locations, and 209 error locations. [2025-01-10 00:08:29,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:08:29,481 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;@5583d80b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:08:29,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 209 error locations. [2025-01-10 00:08:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 490 states, 264 states have (on average 2.0) internal successors, (528), 473 states have internal predecessors, (528), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 00:08:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:08:29,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:29,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:08:29,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:08:29,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 329743, now seen corresponding path program 1 times [2025-01-10 00:08:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856474473] [2025-01-10 00:08:29,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:29,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:08:30,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:08:30,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:30,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856474473] [2025-01-10 00:08:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856474473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:30,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:30,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615512891] [2025-01-10 00:08:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:30,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:30,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:30,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:30,722 INFO L87 Difference]: Start difference. First operand has 490 states, 264 states have (on average 2.0) internal successors, (528), 473 states have internal predecessors, (528), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:34,765 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-01-10 00:08:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:35,257 INFO L93 Difference]: Finished difference Result 374 states and 409 transitions. [2025-01-10 00:08:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:35,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:08:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:35,280 INFO L225 Difference]: With dead ends: 374 [2025-01-10 00:08:35,281 INFO L226 Difference]: Without dead ends: 372 [2025-01-10 00:08:35,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:35,288 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 94 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:35,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 476 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-10 00:08:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-10 00:08:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 324. [2025-01-10 00:08:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 172 states have (on average 1.9767441860465116) internal successors, (340), 314 states have internal predecessors, (340), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:08:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 354 transitions. [2025-01-10 00:08:35,356 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 354 transitions. Word has length 3 [2025-01-10 00:08:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:35,356 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 354 transitions. [2025-01-10 00:08:35,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 354 transitions. [2025-01-10 00:08:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:08:35,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:35,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:08:35,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:08:35,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:08:35,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash 329744, now seen corresponding path program 1 times [2025-01-10 00:08:35,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:35,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285052607] [2025-01-10 00:08:35,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:08:35,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:08:35,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:35,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285052607] [2025-01-10 00:08:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285052607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821334399] [2025-01-10 00:08:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:36,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:36,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:36,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:36,107 INFO L87 Difference]: Start difference. First operand 324 states and 354 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:40,135 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-01-10 00:08:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:40,454 INFO L93 Difference]: Finished difference Result 323 states and 353 transitions. [2025-01-10 00:08:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:40,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:08:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:40,456 INFO L225 Difference]: With dead ends: 323 [2025-01-10 00:08:40,456 INFO L226 Difference]: Without dead ends: 323 [2025-01-10 00:08:40,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:40,457 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 10 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:40,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 548 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-10 00:08:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-10 00:08:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-01-10 00:08:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 172 states have (on average 1.9709302325581395) internal successors, (339), 313 states have internal predecessors, (339), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:08:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 353 transitions. [2025-01-10 00:08:40,491 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 353 transitions. Word has length 3 [2025-01-10 00:08:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:40,491 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 353 transitions. [2025-01-10 00:08:40,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 353 transitions. [2025-01-10 00:08:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:08:40,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:40,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:08:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:08:40,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:08:40,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1233715305, now seen corresponding path program 1 times [2025-01-10 00:08:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646654262] [2025-01-10 00:08:40,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:08:40,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:08:40,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:40,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646654262] [2025-01-10 00:08:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646654262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639238214] [2025-01-10 00:08:41,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:41,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:08:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:41,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:08:41,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:08:41,335 INFO L87 Difference]: Start difference. First operand 323 states and 353 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:45,367 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-01-10 00:08:49,378 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-01-10 00:08:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:49,635 INFO L93 Difference]: Finished difference Result 326 states and 356 transitions. [2025-01-10 00:08:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:08:49,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-01-10 00:08:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:49,638 INFO L225 Difference]: With dead ends: 326 [2025-01-10 00:08:49,638 INFO L226 Difference]: Without dead ends: 326 [2025-01-10 00:08:49,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-10 00:08:49,639 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:49,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 548 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-01-10 00:08:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-10 00:08:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2025-01-10 00:08:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 174 states have (on average 1.9597701149425288) internal successors, (341), 315 states have internal predecessors, (341), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:08:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 355 transitions. [2025-01-10 00:08:49,658 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 355 transitions. Word has length 6 [2025-01-10 00:08:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 355 transitions. [2025-01-10 00:08:49,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 355 transitions. [2025-01-10 00:08:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:49,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:49,659 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:49,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:08:49,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:08:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1577753464, now seen corresponding path program 1 times [2025-01-10 00:08:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550687177] [2025-01-10 00:08:49,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:49,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:49,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550687177] [2025-01-10 00:08:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550687177] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363306874] [2025-01-10 00:08:50,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:50,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:50,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:50,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:08:50,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:50,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:50,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:50,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:50,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:08:50,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:51,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:51,201 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-01-10 00:08:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363306874] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:51,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:08:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670616959] [2025-01-10 00:08:51,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:08:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:51,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:08:51,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:08:51,223 INFO L87 Difference]: Start difference. First operand 325 states and 355 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:55,248 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-01-10 00:08:59,257 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-01-10 00:09:03,265 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-01-10 00:09:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:04,151 INFO L93 Difference]: Finished difference Result 329 states and 359 transitions. [2025-01-10 00:09:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:09:04,152 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:09:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:04,153 INFO L225 Difference]: With dead ends: 329 [2025-01-10 00:09:04,153 INFO L226 Difference]: Without dead ends: 329 [2025-01-10 00:09:04,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 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-01-10 00:09:04,154 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 228 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:04,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1555 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 768 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2025-01-10 00:09:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-01-10 00:09:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-01-10 00:09:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 179 states have (on average 1.9273743016759777) internal successors, (345), 319 states have internal predecessors, (345), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 359 transitions. [2025-01-10 00:09:04,177 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 359 transitions. Word has length 9 [2025-01-10 00:09:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:04,178 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 359 transitions. [2025-01-10 00:09:04,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 359 transitions. [2025-01-10 00:09:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:09:04,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:04,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:04,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:09:04,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:04,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:04,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 595904151, now seen corresponding path program 1 times [2025-01-10 00:09:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560078563] [2025-01-10 00:09:04,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:04,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:09:04,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:09:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:04,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560078563] [2025-01-10 00:09:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560078563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322084855] [2025-01-10 00:09:04,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:04,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:04,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:04,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:09:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:09:05,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:09:05,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:05,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:05,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:09:05,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:05,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322084855] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:05,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 00:09:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567735393] [2025-01-10 00:09:05,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:05,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:09:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:05,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:09:05,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:09:05,576 INFO L87 Difference]: Start difference. First operand 329 states and 359 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:05,636 INFO L93 Difference]: Finished difference Result 344 states and 374 transitions. [2025-01-10 00:09:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:09:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 00:09:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:05,638 INFO L225 Difference]: With dead ends: 344 [2025-01-10 00:09:05,638 INFO L226 Difference]: Without dead ends: 344 [2025-01-10 00:09:05,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:09:05,641 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 4 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:05,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1733 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:09:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-10 00:09:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-01-10 00:09:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 194 states have (on average 1.8556701030927836) internal successors, (360), 334 states have internal predecessors, (360), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 374 transitions. [2025-01-10 00:09:05,654 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 374 transitions. Word has length 15 [2025-01-10 00:09:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:05,654 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 374 transitions. [2025-01-10 00:09:05,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 374 transitions. [2025-01-10 00:09:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:09:05,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:05,656 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:05,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:09:05,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:05,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:05,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1607567448, now seen corresponding path program 2 times [2025-01-10 00:09:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:05,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360921840] [2025-01-10 00:09:05,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:05,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:06,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:09:06,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-01-10 00:09:06,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:09:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-10 00:09:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360921840] [2025-01-10 00:09:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360921840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:06,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:09:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095584276] [2025-01-10 00:09:06,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:06,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:06,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:06,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:06,472 INFO L87 Difference]: Start difference. First operand 344 states and 374 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:06,924 INFO L93 Difference]: Finished difference Result 488 states and 535 transitions. [2025-01-10 00:09:06,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:06,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 00:09:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:06,926 INFO L225 Difference]: With dead ends: 488 [2025-01-10 00:09:06,926 INFO L226 Difference]: Without dead ends: 488 [2025-01-10 00:09:06,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:06,927 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 578 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:06,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 599 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:09:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-01-10 00:09:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 347. [2025-01-10 00:09:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 197 states have (on average 1.8375634517766497) internal successors, (362), 336 states have internal predecessors, (362), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:06,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 376 transitions. [2025-01-10 00:09:06,937 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 376 transitions. Word has length 30 [2025-01-10 00:09:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:06,937 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 376 transitions. [2025-01-10 00:09:06,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 376 transitions. [2025-01-10 00:09:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:09:06,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:06,938 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:06,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:09:06,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:06,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1607567447, now seen corresponding path program 1 times [2025-01-10 00:09:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520758606] [2025-01-10 00:09:06,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:07,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:09:07,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:09:07,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520758606] [2025-01-10 00:09:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520758606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648481523] [2025-01-10 00:09:07,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:07,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:07,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:07,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:09:07,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:09:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:09:08,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:08,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:08,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:09:08,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:08,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648481523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:08,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-01-10 00:09:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466413249] [2025-01-10 00:09:08,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:08,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:09:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:08,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:09:08,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:09:08,347 INFO L87 Difference]: Start difference. First operand 347 states and 376 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:08,413 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2025-01-10 00:09:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:09:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 00:09:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:08,416 INFO L225 Difference]: With dead ends: 353 [2025-01-10 00:09:08,416 INFO L226 Difference]: Without dead ends: 353 [2025-01-10 00:09:08,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:09:08,418 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 2 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:08,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 693 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-10 00:09:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-10 00:09:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 203 states have (on average 1.812807881773399) internal successors, (368), 342 states have internal predecessors, (368), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 382 transitions. [2025-01-10 00:09:08,427 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 382 transitions. Word has length 30 [2025-01-10 00:09:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:08,427 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 382 transitions. [2025-01-10 00:09:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 382 transitions. [2025-01-10 00:09:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:09:08,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:08,428 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:08,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:09:08,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:08,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1303939401, now seen corresponding path program 2 times [2025-01-10 00:09:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451296139] [2025-01-10 00:09:08,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:08,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:08,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:09:08,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:09:08,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:09:08,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451296139] [2025-01-10 00:09:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451296139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:09:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736620040] [2025-01-10 00:09:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:09,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:09:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:09,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:09:09,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:09:09,231 INFO L87 Difference]: Start difference. First operand 353 states and 382 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:13,253 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-01-10 00:09:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:13,914 INFO L93 Difference]: Finished difference Result 637 states and 693 transitions. [2025-01-10 00:09:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-10 00:09:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:13,918 INFO L225 Difference]: With dead ends: 637 [2025-01-10 00:09:13,918 INFO L226 Difference]: Without dead ends: 637 [2025-01-10 00:09:13,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:13,918 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 530 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:13,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 565 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 543 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-10 00:09:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-01-10 00:09:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 352. [2025-01-10 00:09:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 203 states have (on average 1.8078817733990147) internal successors, (367), 341 states have internal predecessors, (367), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2025-01-10 00:09:13,930 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 36 [2025-01-10 00:09:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:13,931 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2025-01-10 00:09:13,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:09:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2025-01-10 00:09:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:09:13,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:13,932 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:13,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:09:13,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:13,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1310840151, now seen corresponding path program 1 times [2025-01-10 00:09:13,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602428893] [2025-01-10 00:09:13,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:13,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:14,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:09:14,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:09:14,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:14,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602428893] [2025-01-10 00:09:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602428893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:09:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455490762] [2025-01-10 00:09:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:09:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:14,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:09:14,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:14,530 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:18,551 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-01-10 00:09:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:18,794 INFO L93 Difference]: Finished difference Result 395 states and 429 transitions. [2025-01-10 00:09:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:18,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:09:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:18,797 INFO L225 Difference]: With dead ends: 395 [2025-01-10 00:09:18,797 INFO L226 Difference]: Without dead ends: 395 [2025-01-10 00:09:18,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:18,797 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 74 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:18,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 477 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-10 00:09:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-10 00:09:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 347. [2025-01-10 00:09:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 203 states have (on average 1.7832512315270936) internal successors, (362), 336 states have internal predecessors, (362), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 376 transitions. [2025-01-10 00:09:18,806 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 376 transitions. Word has length 44 [2025-01-10 00:09:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:18,807 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 376 transitions. [2025-01-10 00:09:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 376 transitions. [2025-01-10 00:09:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:09:18,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:18,808 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:18,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:09:18,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1310840150, now seen corresponding path program 1 times [2025-01-10 00:09:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192862415] [2025-01-10 00:09:18,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:19,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:09:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:09:19,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:19,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192862415] [2025-01-10 00:09:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192862415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:19,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:09:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362159792] [2025-01-10 00:09:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:19,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:19,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:19,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:19,903 INFO L87 Difference]: Start difference. First operand 347 states and 376 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:20,123 INFO L93 Difference]: Finished difference Result 347 states and 377 transitions. [2025-01-10 00:09:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:09:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:20,125 INFO L225 Difference]: With dead ends: 347 [2025-01-10 00:09:20,125 INFO L226 Difference]: Without dead ends: 347 [2025-01-10 00:09:20,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:20,126 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 188 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:20,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1235 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:09:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-01-10 00:09:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 346. [2025-01-10 00:09:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 203 states have (on average 1.7783251231527093) internal successors, (361), 335 states have internal predecessors, (361), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 375 transitions. [2025-01-10 00:09:20,133 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 375 transitions. Word has length 44 [2025-01-10 00:09:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:20,134 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 375 transitions. [2025-01-10 00:09:20,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 375 transitions. [2025-01-10 00:09:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:20,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:20,135 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:20,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:09:20,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:20,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1395987165, now seen corresponding path program 1 times [2025-01-10 00:09:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639761735] [2025-01-10 00:09:20,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:20,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:20,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:20,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:20,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639761735] [2025-01-10 00:09:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639761735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:09:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122158231] [2025-01-10 00:09:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:20,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:20,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:20,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:20,831 INFO L87 Difference]: Start difference. First operand 346 states and 375 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:24,851 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-01-10 00:09:28,856 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-01-10 00:09:32,867 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-01-10 00:09:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:33,430 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2025-01-10 00:09:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:09:33,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:09:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:33,433 INFO L225 Difference]: With dead ends: 412 [2025-01-10 00:09:33,433 INFO L226 Difference]: Without dead ends: 412 [2025-01-10 00:09:33,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:33,433 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 287 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:33,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 721 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-01-10 00:09:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-10 00:09:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 359. [2025-01-10 00:09:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 217 states have (on average 1.76036866359447) internal successors, (382), 348 states have internal predecessors, (382), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 396 transitions. [2025-01-10 00:09:33,444 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 396 transitions. Word has length 47 [2025-01-10 00:09:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 396 transitions. [2025-01-10 00:09:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 396 transitions. [2025-01-10 00:09:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:33,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:33,448 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:09:33,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:33,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1395986078, now seen corresponding path program 1 times [2025-01-10 00:09:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137576299] [2025-01-10 00:09:33,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:33,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:33,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:33,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:33,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:33,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:33,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137576299] [2025-01-10 00:09:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137576299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:33,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:33,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:09:33,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713503058] [2025-01-10 00:09:33,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:33,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:09:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:33,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:09:33,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:09:33,995 INFO L87 Difference]: Start difference. First operand 359 states and 396 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:38,017 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-01-10 00:09:42,025 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-01-10 00:09:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:42,331 INFO L93 Difference]: Finished difference Result 404 states and 446 transitions. [2025-01-10 00:09:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:09:42,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:09:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:42,333 INFO L225 Difference]: With dead ends: 404 [2025-01-10 00:09:42,333 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 00:09:42,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:09:42,334 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 244 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:42,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 540 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-01-10 00:09:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 00:09:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 357. [2025-01-10 00:09:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 217 states have (on average 1.7511520737327189) internal successors, (380), 346 states have internal predecessors, (380), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 394 transitions. [2025-01-10 00:09:42,347 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 394 transitions. Word has length 47 [2025-01-10 00:09:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:42,347 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 394 transitions. [2025-01-10 00:09:42,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 394 transitions. [2025-01-10 00:09:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:42,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:42,348 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:42,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:09:42,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1395986077, now seen corresponding path program 1 times [2025-01-10 00:09:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858214497] [2025-01-10 00:09:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:42,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:42,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:42,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:42,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858214497] [2025-01-10 00:09:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858214497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874599118] [2025-01-10 00:09:42,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:42,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:42,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:42,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:42,971 INFO L87 Difference]: Start difference. First operand 357 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:43,071 INFO L93 Difference]: Finished difference Result 362 states and 393 transitions. [2025-01-10 00:09:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:09:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:43,073 INFO L225 Difference]: With dead ends: 362 [2025-01-10 00:09:43,073 INFO L226 Difference]: Without dead ends: 362 [2025-01-10 00:09:43,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:43,074 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 220 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:43,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1272 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-10 00:09:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 357. [2025-01-10 00:09:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 217 states have (on average 1.7465437788018434) internal successors, (379), 346 states have internal predecessors, (379), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 00:09:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 393 transitions. [2025-01-10 00:09:43,081 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 393 transitions. Word has length 47 [2025-01-10 00:09:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:43,081 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 393 transitions. [2025-01-10 00:09:43,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 393 transitions. [2025-01-10 00:09:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:09:43,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:43,082 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:09:43,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 206 more)] === [2025-01-10 00:09:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 314968755, now seen corresponding path program 1 times [2025-01-10 00:09:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393593617] [2025-01-10 00:09:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:09:43,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:09:43,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393593617] [2025-01-10 00:09:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393593617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:43,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:09:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024280898] [2025-01-10 00:09:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:09:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:43,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:09:43,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:43,626 INFO L87 Difference]: Start difference. First operand 357 states and 393 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)