./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-3.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-3.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 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:08:22,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:08:22,445 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:22,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:08:22,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:08:22,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:08:22,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:08:22,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:08:22,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:08:22,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:08:22,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:08:22,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:08:22,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:08:22,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:08:22,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:08:22,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:08:22,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:22,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:22,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:08:22,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:08:22,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:08:22,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:08:22,500 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 -> 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e [2025-01-10 00:08:22,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:08:22,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:08:22,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:08:22,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:08:22,870 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:08:22,871 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-3.i [2025-01-10 00:08:24,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/318700474/fa11792c73ed4437a1ae676bc34dd690/FLAGc3d039202 [2025-01-10 00:08:24,923 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:08:24,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-01-10 00:08:24,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/318700474/fa11792c73ed4437a1ae676bc34dd690/FLAGc3d039202 [2025-01-10 00:08:24,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/318700474/fa11792c73ed4437a1ae676bc34dd690 [2025-01-10 00:08:24,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:08:25,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:08:25,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:08:25,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:08:25,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:08:25,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:08:24" (1/1) ... [2025-01-10 00:08:25,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:25, skipping insertion in model container [2025-01-10 00:08:25,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:08:24" (1/1) ... [2025-01-10 00:08:25,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:08:26,160 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:26,165 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:26,170 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:26,173 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:26,174 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:26,175 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:26,176 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:26,176 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:26,177 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:26,183 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:26,185 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:26,198 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:26,199 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:26,210 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:26,213 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:26,217 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:26,232 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:26,247 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:26,258 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:26,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:08:26,320 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:08:26,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:08:26,677 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:08:26,689 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:08:26,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:26 WrapperNode [2025-01-10 00:08:26,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:08:26,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:08:26,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:08:26,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:08:26,698 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:26" (1/1) ... [2025-01-10 00:08:26,743 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:26" (1/1) ... [2025-01-10 00:08:26,828 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1043 [2025-01-10 00:08:26,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:08:26,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:08:26,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:08:26,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:08:26,852 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:26" (1/1) ... [2025-01-10 00:08:26,852 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:26" (1/1) ... [2025-01-10 00:08:26,871 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:26" (1/1) ... [2025-01-10 00:08:26,891 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:08:26,892 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:26" (1/1) ... [2025-01-10 00:08:26,892 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:26" (1/1) ... [2025-01-10 00:08:26,943 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:26" (1/1) ... [2025-01-10 00:08:26,950 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:26" (1/1) ... [2025-01-10 00:08:26,967 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:26" (1/1) ... [2025-01-10 00:08:26,984 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:26" (1/1) ... [2025-01-10 00:08:26,994 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:26" (1/1) ... [2025-01-10 00:08:27,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:08:27,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:08:27,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:08:27,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:08:27,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:26" (1/1) ... [2025-01-10 00:08:27,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:27,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:27,060 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:27,064 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:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:08:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:08:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-01-10 00:08:27,089 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-01-10 00:08:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:08:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:08:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:08:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:08:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:08:27,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:08:27,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:08:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:08:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-01-10 00:08:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 00:08:27,091 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 00:08:27,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:08:27,583 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:08:27,587 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:08:33,340 INFO L? ?]: Removed 538 outVars from TransFormulas that were not future-live. [2025-01-10 00:08:33,341 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:08:33,371 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:08:33,372 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-10 00:08:33,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:08:33 BoogieIcfgContainer [2025-01-10 00:08:33,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:08:33,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:08:33,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:08:33,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:08:33,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:08:24" (1/3) ... [2025-01-10 00:08:33,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b67e1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:08:33, skipping insertion in model container [2025-01-10 00:08:33,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:26" (2/3) ... [2025-01-10 00:08:33,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b67e1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:08:33, skipping insertion in model container [2025-01-10 00:08:33,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:08:33" (3/3) ... [2025-01-10 00:08:33,383 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-3.i [2025-01-10 00:08:33,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:08:33,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-3.i that has 6 procedures, 501 locations, 1 initial locations, 14 loop locations, and 211 error locations. [2025-01-10 00:08:33,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:08:33,488 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;@7ee8a988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:08:33,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 211 error locations. [2025-01-10 00:08:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 501 states, 270 states have (on average 1.988888888888889) internal successors, (537), 483 states have internal predecessors, (537), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 00:08:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:08:33,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:33,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:08:33,503 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 208 more)] === [2025-01-10 00:08:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 331729, now seen corresponding path program 1 times [2025-01-10 00:08:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565182053] [2025-01-10 00:08:33,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:34,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:08:34,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:08:34,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:34,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565182053] [2025-01-10 00:08:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565182053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:34,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343646803] [2025-01-10 00:08:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:34,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:34,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:34,773 INFO L87 Difference]: Start difference. First operand has 501 states, 270 states have (on average 1.988888888888889) internal successors, (537), 483 states have internal predecessors, (537), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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:38,821 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:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:39,430 INFO L93 Difference]: Finished difference Result 389 states and 425 transitions. [2025-01-10 00:08:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:39,437 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:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:39,449 INFO L225 Difference]: With dead ends: 389 [2025-01-10 00:08:39,449 INFO L226 Difference]: Without dead ends: 383 [2025-01-10 00:08:39,451 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:39,456 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 102 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:39,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 486 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-10 00:08:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-10 00:08:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 330. [2025-01-10 00:08:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 176 states have (on average 1.9602272727272727) internal successors, (345), 320 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:08:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 359 transitions. [2025-01-10 00:08:39,534 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 359 transitions. Word has length 3 [2025-01-10 00:08:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 359 transitions. [2025-01-10 00:08:39,535 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:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 359 transitions. [2025-01-10 00:08:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:08:39,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:39,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:08:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:08:39,537 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 208 more)] === [2025-01-10 00:08:39,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash 331730, now seen corresponding path program 1 times [2025-01-10 00:08:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790472375] [2025-01-10 00:08:39,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:39,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:08:39,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:08:39,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:39,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:40,368 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:40,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:40,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790472375] [2025-01-10 00:08:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790472375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:40,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107605825] [2025-01-10 00:08:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:40,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:40,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:40,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:40,374 INFO L87 Difference]: Start difference. First operand 330 states and 359 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:44,400 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:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:44,690 INFO L93 Difference]: Finished difference Result 329 states and 358 transitions. [2025-01-10 00:08:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:44,691 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:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:44,693 INFO L225 Difference]: With dead ends: 329 [2025-01-10 00:08:44,693 INFO L226 Difference]: Without dead ends: 329 [2025-01-10 00:08:44,694 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:44,694 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 10 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:44,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 556 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-10 00:08:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-01-10 00:08:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-01-10 00:08:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 176 states have (on average 1.9545454545454546) internal successors, (344), 319 states have internal predecessors, (344), 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:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 358 transitions. [2025-01-10 00:08:44,710 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 358 transitions. Word has length 3 [2025-01-10 00:08:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 358 transitions. [2025-01-10 00:08:44,711 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:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 358 transitions. [2025-01-10 00:08:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:08:44,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:44,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:08:44,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:08:44,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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 208 more)] === [2025-01-10 00:08:44,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1292882408, now seen corresponding path program 1 times [2025-01-10 00:08:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975371036] [2025-01-10 00:08:44,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:44,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:08:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:08:44,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:44,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:45,191 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:45,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975371036] [2025-01-10 00:08:45,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975371036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:45,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:45,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:45,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041012554] [2025-01-10 00:08:45,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:45,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:45,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:45,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:45,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:45,194 INFO L87 Difference]: Start difference. First operand 329 states and 358 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:45,227 INFO L93 Difference]: Finished difference Result 332 states and 362 transitions. [2025-01-10 00:08:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:45,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:45,229 INFO L225 Difference]: With dead ends: 332 [2025-01-10 00:08:45,229 INFO L226 Difference]: Without dead ends: 332 [2025-01-10 00:08:45,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:45,232 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 2 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:45,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 705 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:08:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-10 00:08:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2025-01-10 00:08:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 177 states have (on average 1.9491525423728813) internal successors, (345), 320 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:08:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 359 transitions. [2025-01-10 00:08:45,256 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 359 transitions. Word has length 6 [2025-01-10 00:08:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:45,257 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 359 transitions. [2025-01-10 00:08:45,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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,257 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 359 transitions. [2025-01-10 00:08:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:08:45,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:45,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:08:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:08:45,257 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 208 more)] === [2025-01-10 00:08:45,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1292882217, now seen corresponding path program 1 times [2025-01-10 00:08:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:45,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675460987] [2025-01-10 00:08:45,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:45,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:08:45,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:08:45,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:45,993 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:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675460987] [2025-01-10 00:08:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675460987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663690244] [2025-01-10 00:08:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:45,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:08:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:45,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:08:45,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:08:45,996 INFO L87 Difference]: Start difference. First operand 330 states and 359 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:50,019 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:54,022 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:08:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:54,426 INFO L93 Difference]: Finished difference Result 332 states and 361 transitions. [2025-01-10 00:08:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:08:54,426 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:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:54,428 INFO L225 Difference]: With dead ends: 332 [2025-01-10 00:08:54,428 INFO L226 Difference]: Without dead ends: 332 [2025-01-10 00:08:54,428 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:54,429 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 10 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:54,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 761 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-10 00:08:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-10 00:08:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2025-01-10 00:08:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 178 states have (on average 1.9438202247191012) internal successors, (346), 321 states have internal predecessors, (346), 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:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 360 transitions. [2025-01-10 00:08:54,446 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 360 transitions. Word has length 6 [2025-01-10 00:08:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 360 transitions. [2025-01-10 00:08:54,447 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:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 360 transitions. [2025-01-10 00:08:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:54,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:54,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:08:54,448 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 208 more)] === [2025-01-10 00:08:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1012327623, now seen corresponding path program 1 times [2025-01-10 00:08:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670114938] [2025-01-10 00:08:54,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:54,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:54,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:54,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:54,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670114938] [2025-01-10 00:08:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670114938] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:54,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138631473] [2025-01-10 00:08:54,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:54,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:54,892 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:54,894 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:55,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:55,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:55,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:55,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:55,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:08:55,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:55,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138631473] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:55,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:55,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:08:55,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867951259] [2025-01-10 00:08:55,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:55,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:55,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:55,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:55,532 INFO L87 Difference]: Start difference. First operand 331 states and 360 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:55,590 INFO L93 Difference]: Finished difference Result 339 states and 370 transitions. [2025-01-10 00:08:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:55,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:08:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:55,593 INFO L225 Difference]: With dead ends: 339 [2025-01-10 00:08:55,593 INFO L226 Difference]: Without dead ends: 339 [2025-01-10 00:08:55,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:55,594 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 4 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:55,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1407 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:08:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-10 00:08:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-01-10 00:08:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 186 states have (on average 1.913978494623656) internal successors, (356), 329 states have internal predecessors, (356), 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:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 370 transitions. [2025-01-10 00:08:55,605 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 370 transitions. Word has length 9 [2025-01-10 00:08:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 370 transitions. [2025-01-10 00:08:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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,605 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 370 transitions. [2025-01-10 00:08:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:55,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:55,606 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:55,619 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:08:55,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:55,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 208 more)] === [2025-01-10 00:08:55,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1012327814, now seen corresponding path program 1 times [2025-01-10 00:08:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:55,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848619981] [2025-01-10 00:08:55,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:55,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:56,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:56,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:56,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:56,507 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:56,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848619981] [2025-01-10 00:08:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848619981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831252871] [2025-01-10 00:08:56,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:56,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:56,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:56,511 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:08:56,514 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:08:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:57,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:57,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:57,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:57,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:08:57,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:57,266 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:57,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:57,387 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:57,404 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:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831252871] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:57,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:08:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414444101] [2025-01-10 00:08:57,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:08:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:57,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:08:57,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:08:57,405 INFO L87 Difference]: Start difference. First operand 339 states and 370 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:09:01,433 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:09:05,439 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:09,446 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:13,451 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:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:14,117 INFO L93 Difference]: Finished difference Result 338 states and 367 transitions. [2025-01-10 00:09:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:09:14,118 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:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:14,120 INFO L225 Difference]: With dead ends: 338 [2025-01-10 00:09:14,120 INFO L226 Difference]: Without dead ends: 338 [2025-01-10 00:09:14,120 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:14,121 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 237 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:14,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1413 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 636 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2025-01-10 00:09:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-10 00:09:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-01-10 00:09:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 186 states have (on average 1.8978494623655915) internal successors, (353), 328 states have internal predecessors, (353), 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:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 367 transitions. [2025-01-10 00:09:14,129 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 367 transitions. Word has length 9 [2025-01-10 00:09:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:14,129 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 367 transitions. [2025-01-10 00:09:14,129 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:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 367 transitions. [2025-01-10 00:09:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:09:14,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:14,130 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:14,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:09:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:14,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 208 more)] === [2025-01-10 00:09:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash 560000680, now seen corresponding path program 2 times [2025-01-10 00:09:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777527717] [2025-01-10 00:09:14,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:14,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 00:09:14,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 00:09:14,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:09:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 00:09:14,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:14,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777527717] [2025-01-10 00:09:14,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777527717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:14,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:14,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:09:14,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351981533] [2025-01-10 00:09:14,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:14,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:14,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:14,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:14,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:14,843 INFO L87 Difference]: Start difference. First operand 338 states and 367 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:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:15,464 INFO L93 Difference]: Finished difference Result 487 states and 533 transitions. [2025-01-10 00:09:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:15,464 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 18 [2025-01-10 00:09:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:15,466 INFO L225 Difference]: With dead ends: 487 [2025-01-10 00:09:15,466 INFO L226 Difference]: Without dead ends: 487 [2025-01-10 00:09:15,466 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:15,467 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 206 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:15,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 964 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:09:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-10 00:09:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 341. [2025-01-10 00:09:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 189 states have (on average 1.8783068783068784) internal successors, (355), 330 states have internal predecessors, (355), 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:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 369 transitions. [2025-01-10 00:09:15,476 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 369 transitions. Word has length 18 [2025-01-10 00:09:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:15,476 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 369 transitions. [2025-01-10 00:09:15,476 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:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 369 transitions. [2025-01-10 00:09:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:09:15,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:15,477 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:09:15,478 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 208 more)] === [2025-01-10 00:09:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 560000681, now seen corresponding path program 1 times [2025-01-10 00:09:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352717816] [2025-01-10 00:09:15,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:15,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:09:15,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:09:15,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:15,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:15,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352717816] [2025-01-10 00:09:15,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352717816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:15,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804192205] [2025-01-10 00:09:15,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:15,936 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:15,939 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:16,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:09:16,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:09:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:16,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:09:16,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:16,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:09:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804192205] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:16,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:16,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:09:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736620040] [2025-01-10 00:09:16,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:16,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:09:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:16,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:09:16,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:09:16,617 INFO L87 Difference]: Start difference. First operand 341 states and 369 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:16,687 INFO L93 Difference]: Finished difference Result 359 states and 387 transitions. [2025-01-10 00:09:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:09:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-01-10 00:09:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:16,689 INFO L225 Difference]: With dead ends: 359 [2025-01-10 00:09:16,689 INFO L226 Difference]: Without dead ends: 359 [2025-01-10 00:09:16,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:09:16,690 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 4 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:16,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1403 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-10 00:09:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-01-10 00:09:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 207 states have (on average 1.8019323671497585) internal successors, (373), 348 states have internal predecessors, (373), 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:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 387 transitions. [2025-01-10 00:09:16,700 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 387 transitions. Word has length 18 [2025-01-10 00:09:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:16,700 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 387 transitions. [2025-01-10 00:09:16,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 387 transitions. [2025-01-10 00:09:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:09:16,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:16,701 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:16,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:09:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:16,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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 208 more)] === [2025-01-10 00:09:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:16,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1325923785, now seen corresponding path program 2 times [2025-01-10 00:09:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12013792] [2025-01-10 00:09:16,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:17,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:09:17,132 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:17,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:09:17,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:17,517 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:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12013792] [2025-01-10 00:09:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12013792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:09:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468650563] [2025-01-10 00:09:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:09:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:17,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:09:17,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:09:17,520 INFO L87 Difference]: Start difference. First operand 359 states and 387 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:21,540 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:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:22,245 INFO L93 Difference]: Finished difference Result 648 states and 703 transitions. [2025-01-10 00:09:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:22,245 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:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:22,248 INFO L225 Difference]: With dead ends: 648 [2025-01-10 00:09:22,248 INFO L226 Difference]: Without dead ends: 648 [2025-01-10 00:09:22,248 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:22,250 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 541 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:22,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 574 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 548 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-01-10 00:09:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-10 00:09:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 358. [2025-01-10 00:09:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 207 states have (on average 1.7971014492753623) internal successors, (372), 347 states have internal predecessors, (372), 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:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 386 transitions. [2025-01-10 00:09:22,263 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 386 transitions. Word has length 36 [2025-01-10 00:09:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:22,263 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 386 transitions. [2025-01-10 00:09:22,263 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:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 386 transitions. [2025-01-10 00:09:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:09:22,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:22,265 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:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:09:22,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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 208 more)] === [2025-01-10 00:09:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 91747139, now seen corresponding path program 1 times [2025-01-10 00:09:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101848707] [2025-01-10 00:09:22,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:22,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:09:22,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:09:22,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:22,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:22,865 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:22,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:22,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101848707] [2025-01-10 00:09:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101848707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:09:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772291112] [2025-01-10 00:09:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:22,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:09:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:22,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:09:22,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:22,869 INFO L87 Difference]: Start difference. First operand 358 states and 386 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:26,894 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:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:27,170 INFO L93 Difference]: Finished difference Result 406 states and 439 transitions. [2025-01-10 00:09:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:27,171 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:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:27,173 INFO L225 Difference]: With dead ends: 406 [2025-01-10 00:09:27,175 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 00:09:27,175 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:27,176 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 80 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:27,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 484 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-10 00:09:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 00:09:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 353. [2025-01-10 00:09:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 207 states have (on average 1.7729468599033817) internal successors, (367), 342 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:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 381 transitions. [2025-01-10 00:09:27,187 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 381 transitions. Word has length 44 [2025-01-10 00:09:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:27,188 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 381 transitions. [2025-01-10 00:09:27,188 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:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 381 transitions. [2025-01-10 00:09:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:09:27,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:27,190 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:27,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:09:27,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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 208 more)] === [2025-01-10 00:09:27,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash 91747140, now seen corresponding path program 1 times [2025-01-10 00:09:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743336514] [2025-01-10 00:09:27,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:27,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:27,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:09:27,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:09:27,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:27,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:28,279 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:28,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:28,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743336514] [2025-01-10 00:09:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743336514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:28,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:09:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350504905] [2025-01-10 00:09:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:28,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:28,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:28,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:28,282 INFO L87 Difference]: Start difference. First operand 353 states and 381 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:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:28,498 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2025-01-10 00:09:28,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:28,498 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:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:28,500 INFO L225 Difference]: With dead ends: 353 [2025-01-10 00:09:28,501 INFO L226 Difference]: Without dead ends: 353 [2025-01-10 00:09:28,501 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:28,501 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 193 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:28,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1253 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:09:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-10 00:09:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2025-01-10 00:09:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 207 states have (on average 1.7681159420289856) internal successors, (366), 341 states have internal predecessors, (366), 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:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 380 transitions. [2025-01-10 00:09:28,510 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 380 transitions. Word has length 44 [2025-01-10 00:09:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 380 transitions. [2025-01-10 00:09:28,510 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:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 380 transitions. [2025-01-10 00:09:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:28,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:28,513 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:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:09:28,514 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 208 more)] === [2025-01-10 00:09:28,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1640116810, now seen corresponding path program 1 times [2025-01-10 00:09:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141562868] [2025-01-10 00:09:28,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:28,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:28,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:28,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:29,086 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:29,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141562868] [2025-01-10 00:09:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141562868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:29,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:29,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:09:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901011252] [2025-01-10 00:09:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:09:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:09:29,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:09:29,089 INFO L87 Difference]: Start difference. First operand 352 states and 380 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:33,108 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:37,118 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:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:37,461 INFO L93 Difference]: Finished difference Result 402 states and 435 transitions. [2025-01-10 00:09:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:09:37,462 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:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:37,464 INFO L225 Difference]: With dead ends: 402 [2025-01-10 00:09:37,464 INFO L226 Difference]: Without dead ends: 402 [2025-01-10 00:09:37,464 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:37,465 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 261 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 548 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.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:37,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 548 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-10 00:09:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-10 00:09:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 350. [2025-01-10 00:09:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 207 states have (on average 1.7584541062801933) internal successors, (364), 339 states have internal predecessors, (364), 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:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 378 transitions. [2025-01-10 00:09:37,477 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 378 transitions. Word has length 47 [2025-01-10 00:09:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:37,478 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 378 transitions. [2025-01-10 00:09:37,478 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:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2025-01-10 00:09:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:37,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:37,479 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:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:09:37,479 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 208 more)] === [2025-01-10 00:09:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1640116811, now seen corresponding path program 1 times [2025-01-10 00:09:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925593632] [2025-01-10 00:09:37,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:37,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:38,083 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:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:38,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925593632] [2025-01-10 00:09:38,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925593632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:38,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153860490] [2025-01-10 00:09:38,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:38,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:38,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:38,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:38,085 INFO L87 Difference]: Start difference. First operand 350 states and 378 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:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:38,195 INFO L93 Difference]: Finished difference Result 369 states and 403 transitions. [2025-01-10 00:09:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:38,195 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:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:38,197 INFO L225 Difference]: With dead ends: 369 [2025-01-10 00:09:38,197 INFO L226 Difference]: Without dead ends: 369 [2025-01-10 00:09:38,197 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:38,198 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 229 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:38,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1284 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-10 00:09:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 351. [2025-01-10 00:09:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 208 states have (on average 1.7548076923076923) internal successors, (365), 340 states have internal predecessors, (365), 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:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 379 transitions. [2025-01-10 00:09:38,208 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 379 transitions. Word has length 47 [2025-01-10 00:09:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:38,209 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 379 transitions. [2025-01-10 00:09:38,209 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:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 379 transitions. [2025-01-10 00:09:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:38,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:38,209 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:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:09:38,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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 208 more)] === [2025-01-10 00:09:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1640115723, now seen corresponding path program 1 times [2025-01-10 00:09:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880277352] [2025-01-10 00:09:38,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:38,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:38,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:38,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:38,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:38,892 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:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880277352] [2025-01-10 00:09:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880277352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:09:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263183177] [2025-01-10 00:09:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:38,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:38,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:38,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:38,893 INFO L87 Difference]: Start difference. First operand 351 states and 379 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:42,916 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:46,919 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 []