./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/echo-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/echo-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:02:42,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:02:42,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:02:42,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:02:42,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:02:42,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:02:42,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:02:42,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:02:42,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:02:42,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:02:42,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:02:42,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:02:42,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:02:42,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:02:42,410 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:02:42,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:02:42,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:02:42,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:02:42,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:02:42,412 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:02:42,412 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:02:42,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:02:42,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:42,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:02:42,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd [2025-02-06 12:02:42,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:02:42,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:02:42,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:02:42,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:02:42,717 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:02:42,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-02-06 12:02:44,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84ae46050/ced88798e5b147869a156b448ba854a4/FLAGf7759ea47 [2025-02-06 12:02:44,565 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:02:44,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-02-06 12:02:44,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84ae46050/ced88798e5b147869a156b448ba854a4/FLAGf7759ea47 [2025-02-06 12:02:44,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84ae46050/ced88798e5b147869a156b448ba854a4 [2025-02-06 12:02:44,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:02:44,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:02:44,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:44,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:02:44,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:02:44,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:44" (1/1) ... [2025-02-06 12:02:44,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7324af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:44, skipping insertion in model container [2025-02-06 12:02:44,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:44" (1/1) ... [2025-02-06 12:02:44,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:02:45,707 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,714 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,733 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,738 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,738 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,739 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,739 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,740 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,741 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,742 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,744 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,752 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,759 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,763 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,764 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,767 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,768 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,768 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,775 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,775 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,784 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,804 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:45,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:45,865 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:02:46,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:46,203 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:02:46,213 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:02:46,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46 WrapperNode [2025-02-06 12:02:46,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:46,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:46,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:02:46,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:02:46,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,323 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1053 [2025-02-06 12:02:46,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:46,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:02:46,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:02:46,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:02:46,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,368 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:02:46,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:02:46,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:02:46,450 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:02:46,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:02:46,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (1/1) ... [2025-02-06 12:02:46,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:46,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:02:46,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:02:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:02:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:02:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 12:02:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 12:02:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:02:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:02:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:02:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:02:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:02:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:02:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:02:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:02:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-02-06 12:02:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-02-06 12:02:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:02:46,916 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:02:46,919 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:02:52,492 INFO L? ?]: Removed 477 outVars from TransFormulas that were not future-live. [2025-02-06 12:02:52,493 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:02:52,533 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:02:52,534 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:02:52,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:52 BoogieIcfgContainer [2025-02-06 12:02:52,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:02:52,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:02:52,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:02:52,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:02:52,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:02:44" (1/3) ... [2025-02-06 12:02:52,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7199d010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:52, skipping insertion in model container [2025-02-06 12:02:52,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:46" (2/3) ... [2025-02-06 12:02:52,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7199d010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:52, skipping insertion in model container [2025-02-06 12:02:52,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:52" (3/3) ... [2025-02-06 12:02:52,544 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-1.i [2025-02-06 12:02:52,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:02:52,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-1.i that has 5 procedures, 447 locations, 1 initial locations, 19 loop locations, and 175 error locations. [2025-02-06 12:02:52,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:02:52,630 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;@77c054c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:02:52,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 175 error locations. [2025-02-06 12:02:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 447 states, 258 states have (on average 1.9612403100775193) internal successors, (506), 433 states have internal predecessors, (506), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 12:02:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:52,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:52,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:52,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:02:52,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 581865, now seen corresponding path program 1 times [2025-02-06 12:02:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:52,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357586719] [2025-02-06 12:02:52,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:53,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:53,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:53,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:53,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357586719] [2025-02-06 12:02:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357586719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149341097] [2025-02-06 12:02:53,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:53,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:53,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:53,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:53,953 INFO L87 Difference]: Start difference. First operand has 447 states, 258 states have (on average 1.9612403100775193) internal successors, (506), 433 states have internal predecessors, (506), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-02-06 12:02:57,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:02:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:58,514 INFO L93 Difference]: Finished difference Result 413 states and 476 transitions. [2025-02-06 12:02:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:58,516 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-02-06 12:02:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:58,524 INFO L225 Difference]: With dead ends: 413 [2025-02-06 12:02:58,525 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 12:02:58,526 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-02-06 12:02:58,528 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 227 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:58,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 405 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 12:02:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 12:02:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 296. [2025-02-06 12:02:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 287 states have internal predecessors, (328), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:02:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2025-02-06 12:02:58,581 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 3 [2025-02-06 12:02:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:58,581 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2025-02-06 12:02:58,581 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-02-06 12:02:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2025-02-06 12:02:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:58,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:58,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:02:58,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:02:58,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash 581866, now seen corresponding path program 1 times [2025-02-06 12:02:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459375198] [2025-02-06 12:02:58,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:58,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:58,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:58,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459375198] [2025-02-06 12:02:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459375198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:59,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222378854] [2025-02-06 12:02:59,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:59,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:59,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:59,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:59,390 INFO L87 Difference]: Start difference. First operand 296 states and 338 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-02-06 12:03:03,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:03,703 INFO L93 Difference]: Finished difference Result 295 states and 337 transitions. [2025-02-06 12:03:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:03,704 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-02-06 12:03:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:03,706 INFO L225 Difference]: With dead ends: 295 [2025-02-06 12:03:03,706 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 12:03:03,706 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-02-06 12:03:03,707 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 10 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:03,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 552 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 12:03:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 12:03:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-02-06 12:03:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 179 states have (on average 1.8268156424581006) internal successors, (327), 286 states have internal predecessors, (327), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 337 transitions. [2025-02-06 12:03:03,720 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 337 transitions. Word has length 3 [2025-02-06 12:03:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:03,720 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 337 transitions. [2025-02-06 12:03:03,720 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-02-06 12:03:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 337 transitions. [2025-02-06 12:03:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:03:03,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:03,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:03:03,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:03:03,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:03,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 154988190, now seen corresponding path program 1 times [2025-02-06 12:03:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:03,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502426650] [2025-02-06 12:03:03,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:03,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:04,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:03:04,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:03:04,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:04,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:04,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502426650] [2025-02-06 12:03:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502426650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:04,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:04,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:04,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759562715] [2025-02-06 12:03:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:04,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:04,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:04,325 INFO L87 Difference]: Start difference. First operand 295 states and 337 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:04,359 INFO L93 Difference]: Finished difference Result 298 states and 341 transitions. [2025-02-06 12:03:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:04,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:03:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:04,361 INFO L225 Difference]: With dead ends: 298 [2025-02-06 12:03:04,361 INFO L226 Difference]: Without dead ends: 298 [2025-02-06 12:03:04,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:04,362 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 2 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:04,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 661 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-06 12:03:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2025-02-06 12:03:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 180 states have (on average 1.8222222222222222) internal successors, (328), 287 states have internal predecessors, (328), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2025-02-06 12:03:04,375 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 6 [2025-02-06 12:03:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2025-02-06 12:03:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2025-02-06 12:03:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:03:04,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:04,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:03:04,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:03:04,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:04,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash 154988350, now seen corresponding path program 1 times [2025-02-06 12:03:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:04,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918156074] [2025-02-06 12:03:04,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:04,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:03:04,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:03:04,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:04,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918156074] [2025-02-06 12:03:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918156074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782162689] [2025-02-06 12:03:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:05,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:05,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:05,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:05,151 INFO L87 Difference]: Start difference. First operand 296 states and 338 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-02-06 12:03:09,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:13,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:13,567 INFO L93 Difference]: Finished difference Result 298 states and 340 transitions. [2025-02-06 12:03:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:13,568 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-02-06 12:03:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:13,569 INFO L225 Difference]: With dead ends: 298 [2025-02-06 12:03:13,569 INFO L226 Difference]: Without dead ends: 298 [2025-02-06 12:03:13,569 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-02-06 12:03:13,570 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 10 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:13,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 775 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-06 12:03:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-06 12:03:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2025-02-06 12:03:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 181 states have (on average 1.8176795580110496) internal successors, (329), 288 states have internal predecessors, (329), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 339 transitions. [2025-02-06 12:03:13,581 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 339 transitions. Word has length 6 [2025-02-06 12:03:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 339 transitions. [2025-02-06 12:03:13,581 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-02-06 12:03:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 339 transitions. [2025-02-06 12:03:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:03:13,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:13,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:03:13,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash 168574213, now seen corresponding path program 1 times [2025-02-06 12:03:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122640411] [2025-02-06 12:03:13,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:13,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:03:13,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:03:13,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:13,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122640411] [2025-02-06 12:03:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122640411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854733876] [2025-02-06 12:03:14,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:14,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:14,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:03:14,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:03:14,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:03:14,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:14,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:14,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:03:14,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:14,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854733876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:14,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:14,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:03:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553954202] [2025-02-06 12:03:14,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:03:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:14,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:03:14,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:03:14,910 INFO L87 Difference]: Start difference. First operand 297 states and 339 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:14,955 INFO L93 Difference]: Finished difference Result 305 states and 349 transitions. [2025-02-06 12:03:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:03:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:14,957 INFO L225 Difference]: With dead ends: 305 [2025-02-06 12:03:14,957 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 12:03:14,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:03:14,958 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 4 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:14,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 661 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 12:03:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-02-06 12:03:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 189 states have (on average 1.7936507936507937) internal successors, (339), 296 states have internal predecessors, (339), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 349 transitions. [2025-02-06 12:03:14,967 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 349 transitions. Word has length 9 [2025-02-06 12:03:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:14,967 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 349 transitions. [2025-02-06 12:03:14,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 349 transitions. [2025-02-06 12:03:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:03:14,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:14,968 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:14,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:03:15,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:15,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:15,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 168574373, now seen corresponding path program 1 times [2025-02-06 12:03:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506590741] [2025-02-06 12:03:15,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:15,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:03:15,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:03:15,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:15,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506590741] [2025-02-06 12:03:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506590741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872863157] [2025-02-06 12:03:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:16,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:16,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:16,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:03:16,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:03:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:03:16,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:16,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:03:16,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:16,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:16,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 12:03:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872863157] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:16,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:03:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063138915] [2025-02-06 12:03:16,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:16,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:03:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:16,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:03:16,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:03:16,960 INFO L87 Difference]: Start difference. First operand 305 states and 349 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-02-06 12:03:20,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:24,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:29,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:29,720 INFO L93 Difference]: Finished difference Result 304 states and 346 transitions. [2025-02-06 12:03:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:03:29,721 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-02-06 12:03:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:29,722 INFO L225 Difference]: With dead ends: 304 [2025-02-06 12:03:29,722 INFO L226 Difference]: Without dead ends: 304 [2025-02-06 12:03:29,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:03:29,723 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 295 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:29,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1269 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 468 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-02-06 12:03:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-06 12:03:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-06 12:03:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 189 states have (on average 1.7777777777777777) internal successors, (336), 295 states have internal predecessors, (336), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 12:03:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 346 transitions. [2025-02-06 12:03:29,733 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 346 transitions. Word has length 9 [2025-02-06 12:03:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 346 transitions. [2025-02-06 12:03:29,733 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-02-06 12:03:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 346 transitions. [2025-02-06 12:03:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:03:29,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:29,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:29,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:03:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:29,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1059808290, now seen corresponding path program 2 times [2025-02-06 12:03:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475223154] [2025-02-06 12:03:29,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:30,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 12:03:30,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 12:03:30,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:03:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:30,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 12:03:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:30,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475223154] [2025-02-06 12:03:30,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475223154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:30,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168182273] [2025-02-06 12:03:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:30,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:03:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:30,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:03:30,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:03:30,725 INFO L87 Difference]: Start difference. First operand 304 states and 346 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-02-06 12:03:34,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:35,421 INFO L93 Difference]: Finished difference Result 572 states and 654 transitions. [2025-02-06 12:03:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:35,422 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 18 [2025-02-06 12:03:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:35,424 INFO L225 Difference]: With dead ends: 572 [2025-02-06 12:03:35,424 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 12:03:35,424 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-02-06 12:03:35,425 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 968 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:35,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 497 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 284 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 12:03:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 12:03:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 357. [2025-02-06 12:03:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 239 states have (on average 1.7573221757322175) internal successors, (420), 344 states have internal predecessors, (420), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 434 transitions. [2025-02-06 12:03:35,447 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 434 transitions. Word has length 18 [2025-02-06 12:03:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:35,447 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 434 transitions. [2025-02-06 12:03:35,447 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-02-06 12:03:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 434 transitions. [2025-02-06 12:03:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 12:03:35,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:35,448 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:35,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:03:35,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:35,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash -527308551, now seen corresponding path program 1 times [2025-02-06 12:03:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087702198] [2025-02-06 12:03:35,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:35,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:03:35,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:03:35,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:35,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:36,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087702198] [2025-02-06 12:03:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087702198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524649390] [2025-02-06 12:03:36,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:36,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:03:36,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:03:36,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:03:36,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:36,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:36,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:03:36,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:36,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:37,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524649390] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:37,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:03:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510295689] [2025-02-06 12:03:37,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:37,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:03:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:37,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:03:37,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:03:37,042 INFO L87 Difference]: Start difference. First operand 357 states and 434 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:37,151 INFO L93 Difference]: Finished difference Result 375 states and 452 transitions. [2025-02-06 12:03:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:03:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-06 12:03:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:37,156 INFO L225 Difference]: With dead ends: 375 [2025-02-06 12:03:37,157 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 12:03:37,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:03:37,158 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 4 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:37,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1638 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 12:03:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-02-06 12:03:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 257 states have (on average 1.7042801556420233) internal successors, (438), 362 states have internal predecessors, (438), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 452 transitions. [2025-02-06 12:03:37,177 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 452 transitions. Word has length 26 [2025-02-06 12:03:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:37,177 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 452 transitions. [2025-02-06 12:03:37,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 452 transitions. [2025-02-06 12:03:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:03:37,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:37,179 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:37,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:03:37,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:37,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1780484313, now seen corresponding path program 2 times [2025-02-06 12:03:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983941524] [2025-02-06 12:03:37,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:37,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 12:03:37,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-02-06 12:03:37,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:03:37,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983941524] [2025-02-06 12:03:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983941524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129020452] [2025-02-06 12:03:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:37,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:37,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:37,980 INFO L87 Difference]: Start difference. First operand 375 states and 452 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-02-06 12:03:41,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:42,244 INFO L93 Difference]: Finished difference Result 454 states and 523 transitions. [2025-02-06 12:03:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:42,245 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-02-06 12:03:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:42,248 INFO L225 Difference]: With dead ends: 454 [2025-02-06 12:03:42,248 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 12:03:42,248 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-02-06 12:03:42,250 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 207 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:42,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 407 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 12:03:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 12:03:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 370. [2025-02-06 12:03:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 257 states have (on average 1.6848249027237354) internal successors, (433), 357 states have internal predecessors, (433), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 447 transitions. [2025-02-06 12:03:42,263 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 447 transitions. Word has length 44 [2025-02-06 12:03:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:42,264 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 447 transitions. [2025-02-06 12:03:42,264 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-02-06 12:03:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 447 transitions. [2025-02-06 12:03:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:03:42,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:42,265 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:42,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:03:42,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:42,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1780484314, now seen corresponding path program 1 times [2025-02-06 12:03:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755786824] [2025-02-06 12:03:42,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:42,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:03:42,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:03:42,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:42,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755786824] [2025-02-06 12:03:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755786824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:03:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292059024] [2025-02-06 12:03:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:03:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:43,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:03:43,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:43,499 INFO L87 Difference]: Start difference. First operand 370 states and 447 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:43,897 INFO L93 Difference]: Finished difference Result 412 states and 497 transitions. [2025-02-06 12:03:43,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:43,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:03:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:43,900 INFO L225 Difference]: With dead ends: 412 [2025-02-06 12:03:43,900 INFO L226 Difference]: Without dead ends: 412 [2025-02-06 12:03:43,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:43,901 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 356 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:43,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1123 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:03:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-06 12:03:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 369. [2025-02-06 12:03:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 257 states have (on average 1.6809338521400778) internal successors, (432), 356 states have internal predecessors, (432), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 446 transitions. [2025-02-06 12:03:43,909 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 446 transitions. Word has length 44 [2025-02-06 12:03:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:43,910 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 446 transitions. [2025-02-06 12:03:43,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 446 transitions. [2025-02-06 12:03:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:03:43,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:43,911 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-02-06 12:03:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:03:43,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash -437435586, now seen corresponding path program 1 times [2025-02-06 12:03:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8776402] [2025-02-06 12:03:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:03:44,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:03:44,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:44,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8776402] [2025-02-06 12:03:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8776402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:44,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:03:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67882113] [2025-02-06 12:03:44,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:03:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:44,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:03:44,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:44,761 INFO L87 Difference]: Start difference. First operand 369 states and 446 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-02-06 12:03:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:45,563 INFO L93 Difference]: Finished difference Result 471 states and 543 transitions. [2025-02-06 12:03:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:03:45,563 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-02-06 12:03:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:45,566 INFO L225 Difference]: With dead ends: 471 [2025-02-06 12:03:45,566 INFO L226 Difference]: Without dead ends: 471 [2025-02-06 12:03:45,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:45,567 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 636 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:45,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 616 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:03:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-06 12:03:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 382. [2025-02-06 12:03:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 271 states have (on average 1.6715867158671587) internal successors, (453), 369 states have internal predecessors, (453), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 467 transitions. [2025-02-06 12:03:45,578 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 467 transitions. Word has length 47 [2025-02-06 12:03:45,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:45,579 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 467 transitions. [2025-02-06 12:03:45,579 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-02-06 12:03:45,579 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 467 transitions. [2025-02-06 12:03:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 12:03:45,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:45,581 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] [2025-02-06 12:03:45,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:03:45,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -675629576, now seen corresponding path program 1 times [2025-02-06 12:03:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202508629] [2025-02-06 12:03:45,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:45,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:03:45,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:03:45,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:45,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:46,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202508629] [2025-02-06 12:03:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202508629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912385708] [2025-02-06 12:03:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:46,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:46,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:46,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:46,121 INFO L87 Difference]: Start difference. First operand 382 states and 467 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-02-06 12:03:50,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:54,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:03:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:54,857 INFO L93 Difference]: Finished difference Result 548 states and 642 transitions. [2025-02-06 12:03:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:03:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 48 [2025-02-06 12:03:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:54,860 INFO L225 Difference]: With dead ends: 548 [2025-02-06 12:03:54,860 INFO L226 Difference]: Without dead ends: 548 [2025-02-06 12:03:54,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:03:54,861 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 503 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:54,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 610 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 299 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-02-06 12:03:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-06 12:03:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 390. [2025-02-06 12:03:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 281 states have (on average 1.6583629893238434) internal successors, (466), 377 states have internal predecessors, (466), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 480 transitions. [2025-02-06 12:03:54,873 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 480 transitions. Word has length 48 [2025-02-06 12:03:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:54,874 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 480 transitions. [2025-02-06 12:03:54,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-02-06 12:03:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 480 transitions. [2025-02-06 12:03:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 12:03:54,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:54,876 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] [2025-02-06 12:03:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:03:54,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash -675629575, now seen corresponding path program 1 times [2025-02-06 12:03:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419809800] [2025-02-06 12:03:54,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:55,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:03:55,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:03:55,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:55,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419809800] [2025-02-06 12:03:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419809800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:03:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506610172] [2025-02-06 12:03:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:55,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:03:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:55,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:03:55,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:55,653 INFO L87 Difference]: Start difference. First operand 390 states and 480 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-06 12:03:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:55,830 INFO L93 Difference]: Finished difference Result 395 states and 479 transitions. [2025-02-06 12:03:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:55,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 48 [2025-02-06 12:03:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:55,832 INFO L225 Difference]: With dead ends: 395 [2025-02-06 12:03:55,832 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 12:03:55,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:55,834 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 290 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:55,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1215 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 12:03:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 390. [2025-02-06 12:03:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 281 states have (on average 1.6548042704626333) internal successors, (465), 377 states have internal predecessors, (465), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:03:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 479 transitions. [2025-02-06 12:03:55,844 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 479 transitions. Word has length 48 [2025-02-06 12:03:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 479 transitions. [2025-02-06 12:03:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-06 12:03:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 479 transitions. [2025-02-06 12:03:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:03:55,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:55,847 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-02-06 12:03:55,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:03:55,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:03:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash -712299852, now seen corresponding path program 1 times [2025-02-06 12:03:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:55,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329862969] [2025-02-06 12:03:55,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:56,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:03:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:03:56,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:56,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329862969] [2025-02-06 12:03:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329862969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890229917] [2025-02-06 12:03:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:56,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:56,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:56,467 INFO L87 Difference]: Start difference. First operand 390 states and 479 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-02-06 12:04:00,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:04:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:01,046 INFO L93 Difference]: Finished difference Result 471 states and 553 transitions. [2025-02-06 12:04:01,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:01,047 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-02-06 12:04:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:01,049 INFO L225 Difference]: With dead ends: 471 [2025-02-06 12:04:01,050 INFO L226 Difference]: Without dead ends: 471 [2025-02-06 12:04:01,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:01,051 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 206 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:01,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 403 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 12:04:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-06 12:04:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 389. [2025-02-06 12:04:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 281 states have (on average 1.6476868327402134) internal successors, (463), 376 states have internal predecessors, (463), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:04:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 477 transitions. [2025-02-06 12:04:01,062 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 477 transitions. Word has length 50 [2025-02-06 12:04:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:01,062 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 477 transitions. [2025-02-06 12:04:01,062 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-02-06 12:04:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 477 transitions. [2025-02-06 12:04:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:04:01,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:01,065 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-02-06 12:04:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:04:01,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-06 12:04:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -712299851, now seen corresponding path program 1 times [2025-02-06 12:04:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197394039] [2025-02-06 12:04:01,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:01,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:04:01,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:04:01,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:01,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:02,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197394039] [2025-02-06 12:04:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197394039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:02,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:04:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002761164] [2025-02-06 12:04:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:02,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:04:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:02,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:04:02,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:02,831 INFO L87 Difference]: Start difference. First operand 389 states and 477 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-02-06 12:04:06,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []