./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/usleep-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/usleep-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:17:01,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:17:01,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:17:01,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:17:01,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:17:01,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:17:01,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:17:01,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:17:01,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:17:01,540 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:17:01,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:17:01,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:17:01,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:17:01,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:17:01,541 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:17:01,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:17:01,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:17:01,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:17:01,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:17:01,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:17:01,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:17:01,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:17:01,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:17:01,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:17:01,544 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/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 -> 92819ed386f0d70ff4609309e3718a41b6a1b41ff8c4c600c8db8bc7b56921e0 [2025-03-04 09:17:01,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:17:01,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:17:01,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:17:01,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:17:01,773 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:17:01,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2025-03-04 09:17:02,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775ba1871/8fd25ff40e014831a92caf385dfda653/FLAG8e09778ac [2025-03-04 09:17:03,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:17:03,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/usleep-2.i [2025-03-04 09:17:03,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775ba1871/8fd25ff40e014831a92caf385dfda653/FLAG8e09778ac [2025-03-04 09:17:03,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775ba1871/8fd25ff40e014831a92caf385dfda653 [2025-03-04 09:17:03,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:17:03,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:17:03,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:17:03,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:17:03,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:17:03,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:17:03" (1/1) ... [2025-03-04 09:17:03,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436c86d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:03, skipping insertion in model container [2025-03-04 09:17:03,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:17:03" (1/1) ... [2025-03-04 09:17:03,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:17:04,076 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,081 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,084 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,086 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,087 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,087 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,088 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,089 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,093 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,095 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,102 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,104 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,110 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,111 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,114 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,121 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:04,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:17:04,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:17:04,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:17:04,322 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:17:04,329 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:17:04,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04 WrapperNode [2025-03-04 09:17:04,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:17:04,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:17:04,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:17:04,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:17:04,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,425 INFO L138 Inliner]: procedures = 598, calls = 512, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 889 [2025-03-04 09:17:04,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:17:04,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:17:04,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:17:04,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:17:04,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,454 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 09:17:04,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:17:04,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:17:04,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:17:04,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:17:04,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (1/1) ... [2025-03-04 09:17:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:17:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:04,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:17:04,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:17:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 09:17:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 09:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:17:04,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:17:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:17:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 09:17:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 09:17:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 09:17:04,566 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 09:17:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 09:17:04,808 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:17:04,810 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:17:05,634 INFO L? ?]: Removed 438 outVars from TransFormulas that were not future-live. [2025-03-04 09:17:05,634 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:17:05,660 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:17:05,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:17:05,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:17:05 BoogieIcfgContainer [2025-03-04 09:17:05,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:17:05,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:17:05,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:17:05,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:17:05,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:17:03" (1/3) ... [2025-03-04 09:17:05,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b1a6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:17:05, skipping insertion in model container [2025-03-04 09:17:05,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:04" (2/3) ... [2025-03-04 09:17:05,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b1a6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:17:05, skipping insertion in model container [2025-03-04 09:17:05,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:17:05" (3/3) ... [2025-03-04 09:17:05,667 INFO L128 eAbstractionObserver]: Analyzing ICFG usleep-2.i [2025-03-04 09:17:05,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:17:05,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usleep-2.i that has 4 procedures, 373 locations, 1 initial locations, 12 loop locations, and 155 error locations. [2025-03-04 09:17:05,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:17:05,732 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;@5a676cc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:17:05,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 155 error locations. [2025-03-04 09:17:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 373 states, 206 states have (on average 1.970873786407767) internal successors, (406), 361 states have internal predecessors, (406), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 09:17:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:17:05,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:05,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:17:05,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:05,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash 480579, now seen corresponding path program 1 times [2025-03-04 09:17:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:05,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722328142] [2025-03-04 09:17:05,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:05,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:17:06,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:17:06,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:06,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722328142] [2025-03-04 09:17:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722328142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:06,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640296801] [2025-03-04 09:17:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:06,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:06,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:06,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:06,292 INFO L87 Difference]: Start difference. First operand has 373 states, 206 states have (on average 1.970873786407767) internal successors, (406), 361 states have internal predecessors, (406), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-03-04 09:17:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:06,477 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2025-03-04 09:17:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:06,479 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-03-04 09:17:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:06,485 INFO L225 Difference]: With dead ends: 226 [2025-03-04 09:17:06,486 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 09:17:06,487 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-03-04 09:17:06,490 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 166 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:06,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 190 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 09:17:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2025-03-04 09:17:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 114 states have (on average 1.9298245614035088) internal successors, (220), 202 states have internal predecessors, (220), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2025-03-04 09:17:06,535 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 3 [2025-03-04 09:17:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:06,535 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2025-03-04 09:17:06,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-03-04 09:17:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2025-03-04 09:17:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:17:06,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:06,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:17:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:17:06,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 480580, now seen corresponding path program 1 times [2025-03-04 09:17:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:06,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371743908] [2025-03-04 09:17:06,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:06,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:17:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:17:06,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:06,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371743908] [2025-03-04 09:17:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371743908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:06,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:06,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128456596] [2025-03-04 09:17:06,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:06,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:06,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:06,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:06,759 INFO L87 Difference]: Start difference. First operand 207 states and 226 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-03-04 09:17:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:06,908 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2025-03-04 09:17:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:06,909 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-03-04 09:17:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:06,910 INFO L225 Difference]: With dead ends: 206 [2025-03-04 09:17:06,910 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 09:17:06,910 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-03-04 09:17:06,910 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 10 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:06,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 348 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 09:17:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 09:17:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 114 states have (on average 1.9210526315789473) internal successors, (219), 201 states have internal predecessors, (219), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 225 transitions. [2025-03-04 09:17:06,929 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 225 transitions. Word has length 3 [2025-03-04 09:17:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:06,930 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 225 transitions. [2025-03-04 09:17:06,930 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-03-04 09:17:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 225 transitions. [2025-03-04 09:17:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:17:06,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:06,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:17:06,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:17:06,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:06,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1432443134, now seen corresponding path program 1 times [2025-03-04 09:17:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:06,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899356638] [2025-03-04 09:17:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:06,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:17:06,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:17:06,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:06,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899356638] [2025-03-04 09:17:07,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899356638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:07,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020339129] [2025-03-04 09:17:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:07,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:17:07,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:07,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:17:07,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:17:07,219 INFO L87 Difference]: Start difference. First operand 206 states and 225 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-03-04 09:17:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:07,401 INFO L93 Difference]: Finished difference Result 209 states and 228 transitions. [2025-03-04 09:17:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:17:07,402 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-03-04 09:17:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:07,403 INFO L225 Difference]: With dead ends: 209 [2025-03-04 09:17:07,403 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 09:17:07,403 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-03-04 09:17:07,403 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:07,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 478 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 09:17:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2025-03-04 09:17:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 116 states have (on average 1.9051724137931034) internal successors, (221), 203 states have internal predecessors, (221), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 227 transitions. [2025-03-04 09:17:07,417 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 227 transitions. Word has length 6 [2025-03-04 09:17:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:07,417 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 227 transitions. [2025-03-04 09:17:07,417 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-03-04 09:17:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 227 transitions. [2025-03-04 09:17:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:17:07,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:07,417 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:17:07,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash -881266625, now seen corresponding path program 1 times [2025-03-04 09:17:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765190579] [2025-03-04 09:17:07,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:07,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:17:07,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:17:07,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:07,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765190579] [2025-03-04 09:17:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765190579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124001707] [2025-03-04 09:17:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:07,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:07,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:07,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:07,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:17:07,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:17:07,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:17:07,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:07,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:07,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:17:07,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:07,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:08,080 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-03-04 09:17:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124001707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:08,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:17:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032749390] [2025-03-04 09:17:08,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:08,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:17:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:08,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:17:08,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:17:08,093 INFO L87 Difference]: Start difference. First operand 208 states and 227 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-03-04 09:17:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:08,436 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2025-03-04 09:17:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:17:08,436 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-03-04 09:17:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:08,438 INFO L225 Difference]: With dead ends: 212 [2025-03-04 09:17:08,439 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 09:17:08,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:17:08,439 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 210 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:08,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 917 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:17:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 09:17:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-04 09:17:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 121 states have (on average 1.859504132231405) internal successors, (225), 207 states have internal predecessors, (225), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 231 transitions. [2025-03-04 09:17:08,449 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 231 transitions. Word has length 9 [2025-03-04 09:17:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:08,449 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 231 transitions. [2025-03-04 09:17:08,449 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-03-04 09:17:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 231 transitions. [2025-03-04 09:17:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 09:17:08,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:08,449 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:08,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:17:08,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:08,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash -754784450, now seen corresponding path program 1 times [2025-03-04 09:17:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338295986] [2025-03-04 09:17:08,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:08,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:17:08,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:17:08,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338295986] [2025-03-04 09:17:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338295986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720149808] [2025-03-04 09:17:08,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:08,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:08,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:08,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:08,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:17:08,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:17:09,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:17:09,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:09,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:09,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:17:09,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:09,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:09,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720149808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:09,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:09,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 09:17:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424268030] [2025-03-04 09:17:09,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:09,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:17:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:09,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:17:09,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:17:09,137 INFO L87 Difference]: Start difference. First operand 212 states and 231 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:09,183 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2025-03-04 09:17:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:17:09,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 09:17:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:09,184 INFO L225 Difference]: With dead ends: 227 [2025-03-04 09:17:09,184 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 09:17:09,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:17:09,184 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 4 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:09,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 875 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 09:17:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-04 09:17:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 136 states have (on average 1.7647058823529411) internal successors, (240), 222 states have internal predecessors, (240), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2025-03-04 09:17:09,192 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 15 [2025-03-04 09:17:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2025-03-04 09:17:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2025-03-04 09:17:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 09:17:09,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:09,193 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:09,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:17:09,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:09,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 425810397, now seen corresponding path program 2 times [2025-03-04 09:17:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:09,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315551695] [2025-03-04 09:17:09,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:17:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:09,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 09:17:09,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-04 09:17:09,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:17:09,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 09:17:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315551695] [2025-03-04 09:17:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315551695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:17:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636064073] [2025-03-04 09:17:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:09,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:09,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:09,622 INFO L87 Difference]: Start difference. First operand 227 states and 246 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-03-04 09:17:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:09,756 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2025-03-04 09:17:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:09,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 09:17:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:09,758 INFO L225 Difference]: With dead ends: 247 [2025-03-04 09:17:09,758 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 09:17:09,758 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-03-04 09:17:09,758 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 345 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:09,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 255 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 09:17:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2025-03-04 09:17:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 139 states have (on average 1.7410071942446044) internal successors, (242), 224 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 248 transitions. [2025-03-04 09:17:09,764 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 248 transitions. Word has length 30 [2025-03-04 09:17:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 248 transitions. [2025-03-04 09:17:09,764 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-03-04 09:17:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 248 transitions. [2025-03-04 09:17:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 09:17:09,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:09,765 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:09,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:17:09,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:09,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 425810398, now seen corresponding path program 1 times [2025-03-04 09:17:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835710031] [2025-03-04 09:17:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:17:09,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:17:09,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835710031] [2025-03-04 09:17:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835710031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9645990] [2025-03-04 09:17:10,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:10,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:10,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:17:10,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:17:10,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:17:10,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:10,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:10,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:17:10,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:10,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9645990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:10,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-04 09:17:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512200083] [2025-03-04 09:17:10,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:17:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:10,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:17:10,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:17:10,442 INFO L87 Difference]: Start difference. First operand 230 states and 248 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:10,489 INFO L93 Difference]: Finished difference Result 236 states and 254 transitions. [2025-03-04 09:17:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:17:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-04 09:17:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:10,491 INFO L225 Difference]: With dead ends: 236 [2025-03-04 09:17:10,491 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 09:17:10,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:17:10,493 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 2 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:10,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 871 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 09:17:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-04 09:17:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 145 states have (on average 1.710344827586207) internal successors, (248), 230 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 254 transitions. [2025-03-04 09:17:10,501 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 254 transitions. Word has length 30 [2025-03-04 09:17:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:10,501 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 254 transitions. [2025-03-04 09:17:10,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 254 transitions. [2025-03-04 09:17:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:17:10,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:10,502 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:10,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:17:10,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:10,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1813800510, now seen corresponding path program 2 times [2025-03-04 09:17:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610769550] [2025-03-04 09:17:10,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:17:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:10,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:17:10,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:17:10,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:17:10,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:10,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:10,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610769550] [2025-03-04 09:17:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610769550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264054151] [2025-03-04 09:17:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:10,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:17:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:10,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:17:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:17:10,938 INFO L87 Difference]: Start difference. First operand 236 states and 254 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-03-04 09:17:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:11,120 INFO L93 Difference]: Finished difference Result 252 states and 271 transitions. [2025-03-04 09:17:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:11,121 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-03-04 09:17:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:11,122 INFO L225 Difference]: With dead ends: 252 [2025-03-04 09:17:11,122 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 09:17:11,122 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-03-04 09:17:11,122 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 397 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:11,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 143 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 09:17:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2025-03-04 09:17:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 145 states have (on average 1.703448275862069) internal successors, (247), 229 states have internal predecessors, (247), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 253 transitions. [2025-03-04 09:17:11,130 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 253 transitions. Word has length 36 [2025-03-04 09:17:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:11,130 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 253 transitions. [2025-03-04 09:17:11,131 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-03-04 09:17:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 253 transitions. [2025-03-04 09:17:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:17:11,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:11,131 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:17:11,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash 831190857, now seen corresponding path program 1 times [2025-03-04 09:17:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391911501] [2025-03-04 09:17:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:17:11,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:17:11,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:11,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391911501] [2025-03-04 09:17:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391911501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:11,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055351978] [2025-03-04 09:17:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:11,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:11,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:11,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:11,405 INFO L87 Difference]: Start difference. First operand 235 states and 253 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-03-04 09:17:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:11,531 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2025-03-04 09:17:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:11,531 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-03-04 09:17:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:11,532 INFO L225 Difference]: With dead ends: 247 [2025-03-04 09:17:11,532 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 09:17:11,532 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-03-04 09:17:11,533 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 146 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:11,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 192 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 09:17:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2025-03-04 09:17:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 145 states have (on average 1.6689655172413793) internal successors, (242), 224 states have internal predecessors, (242), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 248 transitions. [2025-03-04 09:17:11,537 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 248 transitions. Word has length 44 [2025-03-04 09:17:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:11,538 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 248 transitions. [2025-03-04 09:17:11,538 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-03-04 09:17:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 248 transitions. [2025-03-04 09:17:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:17:11,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:11,538 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:11,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:17:11,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:11,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash 831190858, now seen corresponding path program 1 times [2025-03-04 09:17:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:11,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256906363] [2025-03-04 09:17:11,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:11,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:17:11,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:17:11,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:11,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256906363] [2025-03-04 09:17:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256906363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:12,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64086992] [2025-03-04 09:17:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:12,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:12,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:12,207 INFO L87 Difference]: Start difference. First operand 230 states and 248 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03-04 09:17:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:12,381 INFO L93 Difference]: Finished difference Result 249 states and 270 transitions. [2025-03-04 09:17:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:17:12,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03-04 09:17:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:12,383 INFO L225 Difference]: With dead ends: 249 [2025-03-04 09:17:12,383 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 09:17:12,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:12,384 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 186 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:12,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 807 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 09:17:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2025-03-04 09:17:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 145 states have (on average 1.6620689655172414) internal successors, (241), 223 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2025-03-04 09:17:12,388 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 44 [2025-03-04 09:17:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:12,388 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2025-03-04 09:17:12,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-03-04 09:17:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2025-03-04 09:17:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:17:12,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:12,389 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-03-04 09:17:12,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:17:12,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:12,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1520759592, now seen corresponding path program 1 times [2025-03-04 09:17:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169367519] [2025-03-04 09:17:12,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:12,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:17:12,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:17:12,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:12,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:12,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:12,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169367519] [2025-03-04 09:17:12,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169367519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:12,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:12,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:17:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714784062] [2025-03-04 09:17:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:12,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:12,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:12,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:12,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:12,779 INFO L87 Difference]: Start difference. First operand 229 states and 247 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-03-04 09:17:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:13,105 INFO L93 Difference]: Finished difference Result 258 states and 280 transitions. [2025-03-04 09:17:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:17:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:13,107 INFO L225 Difference]: With dead ends: 258 [2025-03-04 09:17:13,107 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 09:17:13,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:13,108 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 230 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:13,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 330 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:17:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 09:17:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2025-03-04 09:17:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 159 states have (on average 1.6477987421383649) internal successors, (262), 236 states have internal predecessors, (262), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2025-03-04 09:17:13,116 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 47 [2025-03-04 09:17:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2025-03-04 09:17:13,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2025-03-04 09:17:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:17:13,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:13,118 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-03-04 09:17:13,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:17:13,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:13,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1520758663, now seen corresponding path program 1 times [2025-03-04 09:17:13,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:13,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858249036] [2025-03-04 09:17:13,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:13,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:13,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:17:13,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:17:13,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:13,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:13,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858249036] [2025-03-04 09:17:13,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858249036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:13,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772588536] [2025-03-04 09:17:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:13,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:17:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:13,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:17:13,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:17:13,299 INFO L87 Difference]: Start difference. First operand 242 states and 268 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-03-04 09:17:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:13,459 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2025-03-04 09:17:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:17:13,459 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-03-04 09:17:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:13,460 INFO L225 Difference]: With dead ends: 257 [2025-03-04 09:17:13,461 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 09:17:13,461 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-03-04 09:17:13,461 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 145 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:13,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 305 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 09:17:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2025-03-04 09:17:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 159 states have (on average 1.6352201257861636) internal successors, (260), 234 states have internal predecessors, (260), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 266 transitions. [2025-03-04 09:17:13,471 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 266 transitions. Word has length 47 [2025-03-04 09:17:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:13,471 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 266 transitions. [2025-03-04 09:17:13,471 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-03-04 09:17:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 266 transitions. [2025-03-04 09:17:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:17:13,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:13,471 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-03-04 09:17:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:17:13,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:13,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1520758664, now seen corresponding path program 1 times [2025-03-04 09:17:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:13,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709724823] [2025-03-04 09:17:13,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:13,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:17:13,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:17:13,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:13,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:13,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709724823] [2025-03-04 09:17:13,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709724823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:13,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:13,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558684878] [2025-03-04 09:17:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:13,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:13,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:13,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:13,766 INFO L87 Difference]: Start difference. First operand 240 states and 266 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-03-04 09:17:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:13,828 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2025-03-04 09:17:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:13,829 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-03-04 09:17:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:13,830 INFO L225 Difference]: With dead ends: 245 [2025-03-04 09:17:13,830 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 09:17:13,830 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-03-04 09:17:13,830 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 200 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:13,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 774 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 09:17:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2025-03-04 09:17:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 159 states have (on average 1.628930817610063) internal successors, (259), 234 states have internal predecessors, (259), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 265 transitions. [2025-03-04 09:17:13,838 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 265 transitions. Word has length 47 [2025-03-04 09:17:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:13,838 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 265 transitions. [2025-03-04 09:17:13,838 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-03-04 09:17:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 265 transitions. [2025-03-04 09:17:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:17:13,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:13,841 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:17:13,841 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1634332388, now seen corresponding path program 1 times [2025-03-04 09:17:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370130503] [2025-03-04 09:17:13,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:13,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:17:13,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:17:13,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:13,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:14,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-03-04 09:17:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370130503] [2025-03-04 09:17:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370130503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853353485] [2025-03-04 09:17:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:14,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:14,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:14,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:14,085 INFO L87 Difference]: Start difference. First operand 240 states and 265 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:14,203 INFO L93 Difference]: Finished difference Result 246 states and 273 transitions. [2025-03-04 09:17:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:14,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 09:17:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:14,205 INFO L225 Difference]: With dead ends: 246 [2025-03-04 09:17:14,205 INFO L226 Difference]: Without dead ends: 246 [2025-03-04 09:17:14,205 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-03-04 09:17:14,205 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 137 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:14,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 188 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-04 09:17:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2025-03-04 09:17:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 165 states have (on average 1.6181818181818182) internal successors, (267), 239 states have internal predecessors, (267), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 273 transitions. [2025-03-04 09:17:14,210 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 273 transitions. Word has length 50 [2025-03-04 09:17:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 273 transitions. [2025-03-04 09:17:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 273 transitions. [2025-03-04 09:17:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:17:14,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:14,211 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:14,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:17:14,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:14,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1634332389, now seen corresponding path program 1 times [2025-03-04 09:17:14,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:14,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811953725] [2025-03-04 09:17:14,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:14,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:17:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:17:14,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:14,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:14,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811953725] [2025-03-04 09:17:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811953725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:17:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429314737] [2025-03-04 09:17:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:14,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:17:14,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:14,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:17:14,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:14,726 INFO L87 Difference]: Start difference. First operand 245 states and 273 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:15,119 INFO L93 Difference]: Finished difference Result 255 states and 278 transitions. [2025-03-04 09:17:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 09:17:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:15,121 INFO L225 Difference]: With dead ends: 255 [2025-03-04 09:17:15,121 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 09:17:15,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:15,122 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 183 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:15,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 402 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:17:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 09:17:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2025-03-04 09:17:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 165 states have (on average 1.612121212121212) internal successors, (266), 239 states have internal predecessors, (266), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 272 transitions. [2025-03-04 09:17:15,129 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 272 transitions. Word has length 50 [2025-03-04 09:17:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:15,129 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 272 transitions. [2025-03-04 09:17:15,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 272 transitions. [2025-03-04 09:17:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:17:15,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:15,129 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:15,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:17:15,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:15,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash 647291616, now seen corresponding path program 1 times [2025-03-04 09:17:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580474654] [2025-03-04 09:17:15,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:15,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:17:15,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:17:15,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:15,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580474654] [2025-03-04 09:17:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580474654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738433463] [2025-03-04 09:17:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:15,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:15,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:15,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:15,484 INFO L87 Difference]: Start difference. First operand 245 states and 272 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-03-04 09:17:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:15,687 INFO L93 Difference]: Finished difference Result 244 states and 270 transitions. [2025-03-04 09:17:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-04 09:17:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:15,689 INFO L225 Difference]: With dead ends: 244 [2025-03-04 09:17:15,689 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 09:17:15,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:15,689 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 152 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:15,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 544 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 09:17:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-04 09:17:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 165 states have (on average 1.6) internal successors, (264), 238 states have internal predecessors, (264), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 270 transitions. [2025-03-04 09:17:15,693 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 270 transitions. Word has length 53 [2025-03-04 09:17:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:15,693 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 270 transitions. [2025-03-04 09:17:15,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-03-04 09:17:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 270 transitions. [2025-03-04 09:17:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:17:15,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:15,694 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:17:15,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:15,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash 647291617, now seen corresponding path program 1 times [2025-03-04 09:17:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577920078] [2025-03-04 09:17:15,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:15,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:17:15,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:17:15,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:15,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577920078] [2025-03-04 09:17:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577920078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:16,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:16,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119742854] [2025-03-04 09:17:16,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:16,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:16,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:16,261 INFO L87 Difference]: Start difference. First operand 244 states and 270 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-03-04 09:17:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:16,505 INFO L93 Difference]: Finished difference Result 243 states and 268 transitions. [2025-03-04 09:17:16,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:16,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-04 09:17:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:16,507 INFO L225 Difference]: With dead ends: 243 [2025-03-04 09:17:16,507 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 09:17:16,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:16,508 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 152 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:16,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 677 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 09:17:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-04 09:17:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 165 states have (on average 1.587878787878788) internal successors, (262), 237 states have internal predecessors, (262), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2025-03-04 09:17:16,513 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 53 [2025-03-04 09:17:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2025-03-04 09:17:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-03-04 09:17:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2025-03-04 09:17:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:17:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:16,514 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:17:16,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 979152788, now seen corresponding path program 1 times [2025-03-04 09:17:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506606165] [2025-03-04 09:17:16,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:16,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:17:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:17:16,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506606165] [2025-03-04 09:17:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506606165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:16,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:16,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:16,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223474904] [2025-03-04 09:17:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:16,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:16,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:16,636 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-03-04 09:17:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:16,647 INFO L93 Difference]: Finished difference Result 255 states and 283 transitions. [2025-03-04 09:17:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:16,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 57 [2025-03-04 09:17:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:16,649 INFO L225 Difference]: With dead ends: 255 [2025-03-04 09:17:16,649 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 09:17:16,649 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-03-04 09:17:16,649 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 6 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 409 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-03-04 09:17:16,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 409 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 09:17:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2025-03-04 09:17:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.5808383233532934) internal successors, (264), 239 states have internal predecessors, (264), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2025-03-04 09:17:16,654 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 57 [2025-03-04 09:17:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:16,654 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2025-03-04 09:17:16,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-03-04 09:17:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2025-03-04 09:17:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:17:16,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:16,654 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:16,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:17:16,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 289212058, now seen corresponding path program 1 times [2025-03-04 09:17:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673951331] [2025-03-04 09:17:16,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:16,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:17:16,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:17:16,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:16,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:17,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673951331] [2025-03-04 09:17:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673951331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:17,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:17:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827095180] [2025-03-04 09:17:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:17,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:17:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:17,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:17:17,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:17:17,115 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-03-04 09:17:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:17,511 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2025-03-04 09:17:17,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:17:17,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 58 [2025-03-04 09:17:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:17,512 INFO L225 Difference]: With dead ends: 259 [2025-03-04 09:17:17,513 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 09:17:17,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:17:17,513 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 308 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:17,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 907 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:17:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 09:17:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2025-03-04 09:17:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 173 states have (on average 1.5780346820809248) internal successors, (273), 245 states have internal predecessors, (273), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 279 transitions. [2025-03-04 09:17:17,518 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 279 transitions. Word has length 58 [2025-03-04 09:17:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:17,518 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 279 transitions. [2025-03-04 09:17:17,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-03-04 09:17:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 279 transitions. [2025-03-04 09:17:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:17:17,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:17,520 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:17,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:17:17,520 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:17,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 289212059, now seen corresponding path program 1 times [2025-03-04 09:17:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719105044] [2025-03-04 09:17:17,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:17,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:17:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:17:17,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:17,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719105044] [2025-03-04 09:17:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719105044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:17:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33490865] [2025-03-04 09:17:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:18,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:17:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:18,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:17:18,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:17:18,290 INFO L87 Difference]: Start difference. First operand 251 states and 279 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-03-04 09:17:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:18,800 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2025-03-04 09:17:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:17:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 58 [2025-03-04 09:17:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:18,801 INFO L225 Difference]: With dead ends: 258 [2025-03-04 09:17:18,801 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 09:17:18,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:17:18,802 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 313 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:18,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 675 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:17:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 09:17:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2025-03-04 09:17:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 173 states have (on average 1.5664739884393064) internal successors, (271), 245 states have internal predecessors, (271), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2025-03-04 09:17:18,809 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 58 [2025-03-04 09:17:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2025-03-04 09:17:18,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-03-04 09:17:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2025-03-04 09:17:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 09:17:18,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:18,810 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:18,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:17:18,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:18,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2005643529, now seen corresponding path program 1 times [2025-03-04 09:17:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:18,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785140444] [2025-03-04 09:17:18,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:18,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:17:18,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:17:18,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:18,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:18,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785140444] [2025-03-04 09:17:18,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785140444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:18,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527590113] [2025-03-04 09:17:18,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:18,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:18,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:18,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:17:19,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:17:19,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:17:19,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:19,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:17:19,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:19,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527590113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:19,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:19,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:17:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700941734] [2025-03-04 09:17:19,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:19,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:19,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:19,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:19,312 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-03-04 09:17:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:19,338 INFO L93 Difference]: Finished difference Result 280 states and 311 transitions. [2025-03-04 09:17:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:19,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 62 [2025-03-04 09:17:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:19,339 INFO L225 Difference]: With dead ends: 280 [2025-03-04 09:17:19,339 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 09:17:19,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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-03-04 09:17:19,340 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 18 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 815 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-03-04 09:17:19,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 815 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 09:17:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 275. [2025-03-04 09:17:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 197 states have (on average 1.5482233502538072) internal successors, (305), 269 states have internal predecessors, (305), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 09:17:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 311 transitions. [2025-03-04 09:17:19,345 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 311 transitions. Word has length 62 [2025-03-04 09:17:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:19,345 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 311 transitions. [2025-03-04 09:17:19,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-03-04 09:17:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 311 transitions. [2025-03-04 09:17:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:17:19,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:19,346 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:19,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:17:19,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:19,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 152 more)] === [2025-03-04 09:17:19,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2045160553, now seen corresponding path program 1 times [2025-03-04 09:17:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436259521] [2025-03-04 09:17:19,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:19,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:17:19,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:17:19,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:20,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436259521] [2025-03-04 09:17:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436259521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:20,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740941374] [2025-03-04 09:17:20,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:20,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:20,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:17:20,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:17:20,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:17:20,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:20,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:20,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:17:20,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:20,394 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 10 treesize of output 8 [2025-03-04 09:17:20,429 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:17:20,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:17:20,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 09:17:20,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-04 09:17:20,557 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:17:20,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 09:17:20,614 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:17:20,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 09:17:20,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-04 09:17:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 09:17:20,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:20,776 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2611 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2611) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:17:20,792 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem175#1.base| v_ArrVal_2610))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2611)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:17:20,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2611 (Array Int Int)) (v_ArrVal_2610 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2610))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2611)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:17:24,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:24,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-04 09:17:24,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5374 treesize of output 4198 [2025-03-04 09:17:24,939 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 879 treesize of output 687 [2025-03-04 09:17:24,945 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 687 treesize of output 615 [2025-03-04 09:17:24,952 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 615 treesize of output 483 [2025-03-04 09:17:38,885 WARN L286 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 2313 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-04 09:17:38,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:38,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 561 case distinctions, treesize of input 447 treesize of output 4867