./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.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 ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:40:47,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:40:47,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:40:47,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:40:47,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:40:47,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:40:47,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:40:47,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:40:47,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:40:47,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:40:47,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:40:47,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:40:47,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:40:47,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:40:47,305 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:40:47,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:40:47,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:40:47,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:40:47,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:40:47,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:47,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:40:47,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:40:47,307 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 -> ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a [2025-02-08 07:40:47,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:40:47,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:40:47,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:40:47,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:40:47,482 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:40:47,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-02-08 07:40:48,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e771d4da/0ae738f1df4d4fd1908b56c8ec78bda4/FLAGd64516dbf [2025-02-08 07:40:48,846 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:40:48,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-02-08 07:40:48,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e771d4da/0ae738f1df4d4fd1908b56c8ec78bda4/FLAGd64516dbf [2025-02-08 07:40:49,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e771d4da/0ae738f1df4d4fd1908b56c8ec78bda4 [2025-02-08 07:40:49,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:40:49,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:40:49,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:49,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:40:49,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:40:49,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:49" (1/1) ... [2025-02-08 07:40:49,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4317053d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:49, skipping insertion in model container [2025-02-08 07:40:49,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:49" (1/1) ... [2025-02-08 07:40:49,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:40:50,487 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,490 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,494 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,495 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,497 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,497 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,498 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,498 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,502 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,503 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,507 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,507 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,513 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,514 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,516 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,531 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:50,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:50,571 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:40:50,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:50,786 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:40:50,795 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:40:50,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50 WrapperNode [2025-02-08 07:40:50,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:50,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:50,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:40:50,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:40:50,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,915 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 996 [2025-02-08 07:40:50,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:50,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:40:50,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:40:50,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:40:50,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,945 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:40:50,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:40:50,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:40:50,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:40:50,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:40:50,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (1/1) ... [2025-02-08 07:40:50,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:51,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:51,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:40:51,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:40:51,036 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-02-08 07:40:51,036 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-02-08 07:40:51,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:40:51,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:40:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:40:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:40:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:40:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:40:51,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:40:51,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:40:51,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:40:51,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:40:51,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:40:51,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:40:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:40:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 07:40:51,040 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 07:40:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:40:51,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:40:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:40:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:40:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 07:40:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:40:51,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:40:51,333 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:40:51,335 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:40:51,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem134#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:40:51,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: SUMMARY for call safe_write_#t~mem134#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:40:51,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:40:51,736 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2398: bb_verror_msg_#t~ret111#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet122#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret111#1 && bb_verror_msg_#t~ret111#1 <= 2147483647;havoc bb_verror_msg_#t~ret111#1; [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem112#1.base, bb_verror_msg_#t~mem112#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret123#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399: bb_verror_msg_#t~ret113#1 := full_write_#res#1;havoc full_write_#t~ret123#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret113#1 && bb_verror_msg_#t~ret113#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem112#1.base, bb_verror_msg_#t~mem112#1.offset;havoc bb_verror_msg_#t~ret113#1; [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-2: SUMMARY for call bb_verror_msg_#t~mem112#1.base, bb_verror_msg_#t~mem112#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet193#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet193#1;assume -9223372036854775808 <= write_#t~nondet193#1 && write_#t~nondet193#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet193#1;havoc write_#t~nondet193#1; [2025-02-08 07:40:51,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !true; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret133#1, safe_write_#t~mem134#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: safe_write_#t~ret133#1 := write_#res#1;havoc write_#t~nondet193#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret133#1 && safe_write_#t~ret133#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret133#1;havoc safe_write_#t~ret133#1; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437: full_write_#t~ret123#1 := safe_write_#res#1;havoc safe_write_#t~ret133#1, safe_write_#t~mem134#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret123#1 && full_write_#t~ret123#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret123#1;havoc full_write_#t~ret123#1; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: write_#res#1 := write_~ret~1#1; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume safe_write_~n~0#1 < 0; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:40:51,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume full_write_~cc~0#1 < 0; [2025-02-08 07:40:51,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:40:53,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579: havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset;get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset := bb_internal_getpwuid_#res#1.base, bb_internal_getpwuid_#res#1.offset;havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset, bb_internal_getpwuid_~uid#1;havoc bb_internal_getpwuid_#in~uid#1;assume { :end_inline_bb_internal_getpwuid } true;get_shell_name_~pw~0#1.base, get_shell_name_~pw~0#1.offset := get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset;havoc get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset; [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579-2: bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset := bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset;havoc bb_internal_getpwnam_#t~nondet157#1, bb_internal_getpwnam_#t~nondet158#1, bb_internal_getpwnam_#t~nondet159#1, bb_internal_getpwnam_~name#1.base, bb_internal_getpwnam_~name#1.offset;havoc bb_internal_getpwnam_#in~name#1.base, bb_internal_getpwnam_#in~name#1.offset;assume { :end_inline_bb_internal_getpwnam } true;bb_internal_getpwuid_#res#1.base, bb_internal_getpwuid_#res#1.offset := bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset;havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset; [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464: assume !(get_shell_name_#t~mem129#1.base == 0 && get_shell_name_#t~mem129#1.offset == 0);havoc get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset; [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464: assume !!(get_shell_name_#t~mem129#1.base == 0 && get_shell_name_#t~mem129#1.offset == 0);havoc get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset; [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: SUMMARY for call get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset := read~$Pointer$(get_shell_name_~pw~0#1.base, 40 + get_shell_name_~pw~0#1.offset, 8); srcloc: null [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: assume !(1 == #valid[get_shell_name_~pw~0#1.base]); [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: assume !(8 + (40 + get_shell_name_~pw~0#1.offset) <= #length[get_shell_name_~pw~0#1.base] && 0 <= 40 + get_shell_name_~pw~0#1.offset); [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: SUMMARY for call write~$Pointer$(11, 0, ~#p~1.base, ~#p~1.offset, 8); srcloc: null [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: assume !(8 + ~#p~1.offset <= #length[~#p~1.base] && 0 <= ~#p~1.offset); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !(0 == get_shell_name_#t~mem131#1);havoc get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset;havoc get_shell_name_#t~mem131#1; [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !!(0 == get_shell_name_#t~mem131#1);havoc get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset;havoc get_shell_name_#t~mem131#1; [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466-2: SUMMARY for call get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset := read~$Pointer$(get_shell_name_~pw~0#1.base, 40 + get_shell_name_~pw~0#1.offset, 8); srcloc: null [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466-2: assume !(1 == #valid[get_shell_name_~pw~0#1.base]); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466-2: assume !(8 + (40 + get_shell_name_~pw~0#1.offset) <= #length[get_shell_name_~pw~0#1.base] && 0 <= 40 + get_shell_name_~pw~0#1.offset); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466-1: SUMMARY for call get_shell_name_#t~mem131#1 := read~int(get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset, 1); srcloc: null [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466-1: assume !(1 == #valid[get_shell_name_#t~mem130#1.base]); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466-1: assume !(1 + get_shell_name_#t~mem130#1.offset <= #length[get_shell_name_#t~mem130#1.base] && 0 <= get_shell_name_#t~mem130#1.offset); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: havoc bb_internal_getpwnam_#t~nondet157#1; [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-1: SUMMARY for call write~$Pointer$(12, 0, ~#p~1.base, 8 + ~#p~1.offset, 8); srcloc: null [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-1: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-1: assume !(8 + (8 + ~#p~1.offset) <= #length[~#p~1.base] && 0 <= 8 + ~#p~1.offset); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467-1: get_shell_name_#res#1.base, get_shell_name_#res#1.offset := get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset;havoc get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset; [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467-2: SUMMARY for call get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset := read~$Pointer$(get_shell_name_~pw~0#1.base, 40 + get_shell_name_~pw~0#1.offset, 8); srcloc: null [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467-2: assume !(1 == #valid[get_shell_name_~pw~0#1.base]); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467-2: assume !(8 + (40 + get_shell_name_~pw~0#1.offset) <= #length[get_shell_name_~pw~0#1.base] && 0 <= 40 + get_shell_name_~pw~0#1.offset); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: SUMMARY for call write~int(bb_internal_getpwnam_#t~nondet157#1, ~#p~1.base, 16 + ~#p~1.offset, 4); srcloc: null [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: assume !(4 + (16 + ~#p~1.offset) <= #length[~#p~1.base] && 0 <= 16 + ~#p~1.offset); [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: havoc bb_internal_getpwnam_#t~nondet157#1;havoc bb_internal_getpwnam_#t~nondet158#1; [2025-02-08 07:40:53,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2419: __main_#t~ret120#1.base, __main_#t~ret120#1.offset := get_shell_name_#res#1.base, get_shell_name_#res#1.offset;havoc get_shell_name_#t~nondet124#1.base, get_shell_name_#t~nondet124#1.offset, get_shell_name_#t~nondet125#1, get_shell_name_#t~mem126#1, get_shell_name_#t~ret127#1, get_shell_name_#t~ret128#1.base, get_shell_name_#t~ret128#1.offset, get_shell_name_#t~mem129#1.base, get_shell_name_#t~mem129#1.offset, get_shell_name_#t~mem130#1.base, get_shell_name_#t~mem130#1.offset, get_shell_name_#t~mem131#1, get_shell_name_#t~mem132#1.base, get_shell_name_#t~mem132#1.offset, get_shell_name_~pw~0#1.base, get_shell_name_~pw~0#1.offset, get_shell_name_~shell~0#1.base, get_shell_name_~shell~0#1.offset, get_shell_name_~return_value_getuid$1~0#1;assume { :end_inline_get_shell_name } true;__main_~return_value_get_shell_name$1~0#1.base, __main_~return_value_get_shell_name$1~0#1.offset := __main_#t~ret120#1.base, __main_#t~ret120#1.offset;havoc __main_#t~ret120#1.base, __main_#t~ret120#1.offset; [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568: havoc bb_internal_getpwnam_#t~nondet158#1; [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568-1: SUMMARY for call write~int(bb_internal_getpwnam_#t~nondet158#1, ~#p~1.base, 20 + ~#p~1.offset, 4); srcloc: null [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568-1: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568-1: assume !(4 + (20 + ~#p~1.offset) <= #length[~#p~1.base] && 0 <= 20 + ~#p~1.offset); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: havoc getuid_#t~nondet148#1;get_shell_name_#t~ret127#1 := getuid_#res#1;havoc getuid_#t~nondet148#1;assume { :end_inline_getuid } true;get_shell_name_~return_value_getuid$1~0#1 := get_shell_name_#t~ret127#1;havoc get_shell_name_#t~ret127#1;assume { :begin_inline_bb_internal_getpwuid } true;bb_internal_getpwuid_#in~uid#1 := get_shell_name_~return_value_getuid$1~0#1;havoc bb_internal_getpwuid_#res#1.base, bb_internal_getpwuid_#res#1.offset;havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset, bb_internal_getpwuid_~uid#1;bb_internal_getpwuid_~uid#1 := bb_internal_getpwuid_#in~uid#1;assume { :begin_inline_bb_internal_getpwnam } true;bb_internal_getpwnam_#in~name#1.base, bb_internal_getpwnam_#in~name#1.offset := 0, 0;havoc bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset;havoc bb_internal_getpwnam_#t~nondet157#1, bb_internal_getpwnam_#t~nondet158#1, bb_internal_getpwnam_#t~nondet159#1, bb_internal_getpwnam_~name#1.base, bb_internal_getpwnam_~name#1.offset;bb_internal_getpwnam_~name#1.base, bb_internal_getpwnam_~name#1.offset := bb_internal_getpwnam_#in~name#1.base, bb_internal_getpwnam_#in~name#1.offset; [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: SUMMARY for call write~$Pointer$(__main_~return_value_get_shell_name$1~0#1.base, __main_~return_value_get_shell_name$1~0#1.offset, __main_~argv#1.base, __main_~argv#1.offset, 8); srcloc: null [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: assume !(1 == #valid[__main_~argv#1.base]); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: assume !(8 + __main_~argv#1.offset <= #length[__main_~argv#1.base] && 0 <= __main_~argv#1.offset); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc find_applet_by_name_#t~nondet78#1; [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569: SUMMARY for call write~$Pointer$(13, 0, ~#p~1.base, 24 + ~#p~1.offset, 8); srcloc: null [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569: assume !(8 + (24 + ~#p~1.offset) <= #length[~#p~1.base] && 0 <= 24 + ~#p~1.offset); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470-1: get_shell_name_#res#1.base, get_shell_name_#res#1.offset := ~#bb_default_login_shell~0.base, 1 + ~#bb_default_login_shell~0.offset; [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421-1: SUMMARY for call write~$Pointer$(7, 0, __main_~argv#1.base, 8 + __main_~argv#1.offset, 8); srcloc: null [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421-1: assume !(1 == #valid[__main_~argv#1.base]); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421-1: assume !(8 + (8 + __main_~argv#1.offset) <= #length[__main_~argv#1.base] && 0 <= 8 + __main_~argv#1.offset); [2025-02-08 07:40:53,121 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421: havoc __main_~return_value_get_shell_name$1~0#1.base, __main_~return_value_get_shell_name$1~0#1.offset; [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: SUMMARY for call write~$Pointer$(14, 0, ~#p~1.base, 32 + ~#p~1.offset, 8); srcloc: null [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: assume !(8 + (32 + ~#p~1.offset) <= #length[~#p~1.base] && 0 <= 32 + ~#p~1.offset); [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571-1: SUMMARY for call write~$Pointer$(15, 0, ~#p~1.base, 40 + ~#p~1.offset, 8); srcloc: null [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571-1: assume !(1 == #valid[~#p~1.base]); [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571-1: assume !(8 + (40 + ~#p~1.offset) <= #length[~#p~1.base] && 0 <= 40 + ~#p~1.offset); [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: havoc bb_internal_getpwnam_#t~nondet159#1; [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: assume 0 != bb_internal_getpwnam_#t~nondet159#1 % 4294967296;havoc bb_internal_getpwnam_#t~nondet159#1;bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset := 0, 0; [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: assume !(0 != bb_internal_getpwnam_#t~nondet159#1 % 4294967296);havoc bb_internal_getpwnam_#t~nondet159#1;bb_internal_getpwnam_#res#1.base, bb_internal_getpwnam_#res#1.offset := ~#p~1.base, ~#p~1.offset; [2025-02-08 07:40:53,122 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !(get_shell_name_~pw~0#1.base == 0 && get_shell_name_~pw~0#1.offset == 0); [2025-02-08 07:40:53,123 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !!(get_shell_name_~pw~0#1.base == 0 && get_shell_name_~pw~0#1.offset == 0); [2025-02-08 07:40:53,204 INFO L? ?]: Removed 385 outVars from TransFormulas that were not future-live. [2025-02-08 07:40:53,204 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:40:53,220 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:40:53,220 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:40:53,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:53 BoogieIcfgContainer [2025-02-08 07:40:53,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:40:53,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:40:53,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:40:53,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:40:53,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:40:49" (1/3) ... [2025-02-08 07:40:53,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba5a9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:53, skipping insertion in model container [2025-02-08 07:40:53,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:50" (2/3) ... [2025-02-08 07:40:53,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba5a9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:53, skipping insertion in model container [2025-02-08 07:40:53,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:53" (3/3) ... [2025-02-08 07:40:53,227 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2025-02-08 07:40:53,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:40:53,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 362 locations, 1 initial locations, 12 loop locations, and 177 error locations. [2025-02-08 07:40:53,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:40:53,276 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;@6d6d5d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:40:53,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 177 error locations. [2025-02-08 07:40:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 190 states have (on average 1.9736842105263157) internal successors, (375), 347 states have internal predecessors, (375), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 07:40:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:53,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:53,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:53,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:40:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 17343, now seen corresponding path program 1 times [2025-02-08 07:40:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904832839] [2025-02-08 07:40:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:53,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:53,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:53,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904832839] [2025-02-08 07:40:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904832839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:53,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836115152] [2025-02-08 07:40:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:53,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:53,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:53,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:53,952 INFO L87 Difference]: Start difference. First operand has 362 states, 190 states have (on average 1.9736842105263157) internal successors, (375), 347 states have internal predecessors, (375), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,130 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-02-08 07:40:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:54,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:40:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,137 INFO L225 Difference]: With dead ends: 183 [2025-02-08 07:40:54,137 INFO L226 Difference]: Without dead ends: 171 [2025-02-08 07:40:54,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,140 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 133 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 163 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-08 07:40:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-08 07:40:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 95 states have (on average 1.8105263157894738) internal successors, (172), 163 states have internal predecessors, (172), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:40:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2025-02-08 07:40:54,170 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 2 [2025-02-08 07:40:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,171 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2025-02-08 07:40:54,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2025-02-08 07:40:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:54,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:54,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:40:54,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:40:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 17344, now seen corresponding path program 1 times [2025-02-08 07:40:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621035731] [2025-02-08 07:40:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:54,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:54,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621035731] [2025-02-08 07:40:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621035731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281992312] [2025-02-08 07:40:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:54,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,587 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,687 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2025-02-08 07:40:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:54,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:40:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,688 INFO L225 Difference]: With dead ends: 170 [2025-02-08 07:40:54,688 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 07:40:54,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,689 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 276 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 07:40:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-08 07:40:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 95 states have (on average 1.8) internal successors, (171), 162 states have internal predecessors, (171), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:40:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2025-02-08 07:40:54,697 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 2 [2025-02-08 07:40:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,697 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2025-02-08 07:40:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2025-02-08 07:40:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:40:54,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:40:54,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:40:54,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:40:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 517139772, now seen corresponding path program 1 times [2025-02-08 07:40:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011421777] [2025-02-08 07:40:54,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:40:54,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:40:54,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011421777] [2025-02-08 07:40:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011421777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:40:54,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016798376] [2025-02-08 07:40:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:54,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,964 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:55,434 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2025-02-08 07:40:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:55,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:40:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:55,435 INFO L225 Difference]: With dead ends: 173 [2025-02-08 07:40:55,435 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 07:40:55,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:55,436 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:55,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:40:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 07:40:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-02-08 07:40:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 96 states have (on average 1.7916666666666667) internal successors, (172), 163 states have internal predecessors, (172), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:40:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2025-02-08 07:40:55,443 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 5 [2025-02-08 07:40:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:55,443 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2025-02-08 07:40:55,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2025-02-08 07:40:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:40:55,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:55,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:40:55,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:40:55,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:40:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 517139933, now seen corresponding path program 1 times [2025-02-08 07:40:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230059229] [2025-02-08 07:40:55,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:55,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:40:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:40:55,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230059229] [2025-02-08 07:40:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230059229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:55,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879636783] [2025-02-08 07:40:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:55,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:55,817 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:56,886 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2025-02-08 07:40:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:40:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:56,888 INFO L225 Difference]: With dead ends: 173 [2025-02-08 07:40:56,888 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 07:40:56,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:56,888 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 10 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:56,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 377 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:40:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 07:40:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2025-02-08 07:40:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 97 states have (on average 1.7835051546391754) internal successors, (173), 164 states have internal predecessors, (173), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:40:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 184 transitions. [2025-02-08 07:40:56,894 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 184 transitions. Word has length 5 [2025-02-08 07:40:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:56,894 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 184 transitions. [2025-02-08 07:40:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 184 transitions. [2025-02-08 07:40:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:40:56,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:56,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:56,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:40:56,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:40:56,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash 68493114, now seen corresponding path program 1 times [2025-02-08 07:40:56,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:56,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342238134] [2025-02-08 07:40:56,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:56,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:56,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:56,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:56,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:57,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:57,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342238134] [2025-02-08 07:40:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342238134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:57,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785294787] [2025-02-08 07:40:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:57,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:57,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:57,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:57,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:40:57,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:57,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:57,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:57,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:40:57,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:57,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:57,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785294787] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:57,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:57,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:40:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544557186] [2025-02-08 07:40:57,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:57,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:57,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:57,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:57,518 INFO L87 Difference]: Start difference. First operand 172 states and 184 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:58,693 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2025-02-08 07:40:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:40:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:58,694 INFO L225 Difference]: With dead ends: 180 [2025-02-08 07:40:58,694 INFO L226 Difference]: Without dead ends: 180 [2025-02-08 07:40:58,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:58,695 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 4 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:58,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 528 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:40:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-08 07:40:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-08 07:40:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 105 states have (on average 1.7428571428571429) internal successors, (183), 172 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:40:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2025-02-08 07:40:58,700 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 8 [2025-02-08 07:40:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:58,700 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2025-02-08 07:40:58,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2025-02-08 07:40:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:40:58,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:58,700 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:58,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:40:58,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:58,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:40:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash 68493275, now seen corresponding path program 1 times [2025-02-08 07:40:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527604863] [2025-02-08 07:40:58,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:58,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:58,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:58,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:58,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527604863] [2025-02-08 07:40:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527604863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739300331] [2025-02-08 07:40:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:59,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:59,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:59,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:59,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:40:59,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:59,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:59,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:59,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:59,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:40:59,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:59,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:59,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:40:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739300331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:59,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:40:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526191957] [2025-02-08 07:40:59,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:59,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:40:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:59,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:40:59,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:40:59,830 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:01,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:02,772 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2025-02-08 07:41:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:41:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:02,773 INFO L225 Difference]: With dead ends: 179 [2025-02-08 07:41:02,773 INFO L226 Difference]: Without dead ends: 179 [2025-02-08 07:41:02,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:41:02,774 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 260 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:02,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 689 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 07:41:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-08 07:41:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-02-08 07:41:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 171 states have internal predecessors, (180), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2025-02-08 07:41:02,783 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 191 transitions. Word has length 8 [2025-02-08 07:41:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:02,783 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 191 transitions. [2025-02-08 07:41:02,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 191 transitions. [2025-02-08 07:41:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:41:02,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:02,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:41:02,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:41:02,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:02,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1683499964, now seen corresponding path program 2 times [2025-02-08 07:41:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859807625] [2025-02-08 07:41:02,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:03,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 07:41:03,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 07:41:03,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:41:03,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 07:41:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859807625] [2025-02-08 07:41:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859807625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499463203] [2025-02-08 07:41:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:03,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:03,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:03,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:03,313 INFO L87 Difference]: Start difference. First operand 179 states and 191 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:03,425 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2025-02-08 07:41:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 07:41:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:03,426 INFO L225 Difference]: With dead ends: 178 [2025-02-08 07:41:03,426 INFO L226 Difference]: Without dead ends: 178 [2025-02-08 07:41:03,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:03,427 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 157 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:03,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 133 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-08 07:41:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-02-08 07:41:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.7047619047619047) internal successors, (179), 170 states have internal predecessors, (179), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2025-02-08 07:41:03,438 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 17 [2025-02-08 07:41:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:03,439 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2025-02-08 07:41:03,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2025-02-08 07:41:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:41:03,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:03,439 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:41:03,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:41:03,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:03,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1683499965, now seen corresponding path program 1 times [2025-02-08 07:41:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608532447] [2025-02-08 07:41:03,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:03,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:41:03,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:41:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:03,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:03,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:03,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608532447] [2025-02-08 07:41:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608532447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694849218] [2025-02-08 07:41:03,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:03,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:03,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:03,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:41:04,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:41:04,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:41:04,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:04,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:04,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:41:04,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:04,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694849218] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:04,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:04,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:41:04,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574980254] [2025-02-08 07:41:04,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:04,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:41:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:04,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:41:04,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:41:04,307 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:04,656 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2025-02-08 07:41:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 07:41:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:04,658 INFO L225 Difference]: With dead ends: 196 [2025-02-08 07:41:04,658 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 07:41:04,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-08 07:41:04,659 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 4 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:04,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 351 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:41:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 07:41:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 07:41:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 123 states have (on average 1.6016260162601625) internal successors, (197), 188 states have internal predecessors, (197), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2025-02-08 07:41:04,667 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 17 [2025-02-08 07:41:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:04,667 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2025-02-08 07:41:04,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2025-02-08 07:41:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:41:04,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:04,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-02-08 07:41:04,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:04,868 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-08 07:41:04,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:04,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2136227459, now seen corresponding path program 2 times [2025-02-08 07:41:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686365016] [2025-02-08 07:41:04,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:04,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:41:04,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 07:41:04,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:41:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,225 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-08 07:41:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686365016] [2025-02-08 07:41:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686365016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:05,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693516182] [2025-02-08 07:41:05,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:05,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:05,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:05,226 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:05,357 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2025-02-08 07:41:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 07:41:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:05,358 INFO L225 Difference]: With dead ends: 199 [2025-02-08 07:41:05,358 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 07:41:05,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:05,359 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:05,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 375 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 07:41:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 07:41:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 190 states have internal predecessors, (199), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 210 transitions. [2025-02-08 07:41:05,364 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 210 transitions. Word has length 35 [2025-02-08 07:41:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:05,364 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 210 transitions. [2025-02-08 07:41:05,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 210 transitions. [2025-02-08 07:41:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:41:05,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:05,365 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:05,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:41:05,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2145879163, now seen corresponding path program 1 times [2025-02-08 07:41:05,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:05,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587918973] [2025-02-08 07:41:05,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:05,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:05,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:41:05,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:41:05,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:05,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,693 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-08 07:41:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587918973] [2025-02-08 07:41:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587918973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312568726] [2025-02-08 07:41:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:05,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:05,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:05,695 INFO L87 Difference]: Start difference. First operand 199 states and 210 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-08 07:41:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:06,526 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2025-02-08 07:41:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 43 [2025-02-08 07:41:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:06,527 INFO L225 Difference]: With dead ends: 194 [2025-02-08 07:41:06,527 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 07:41:06,527 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-08 07:41:06,528 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 103 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:06,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 156 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 07:41:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 07:41:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 07:41:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 126 states have (on average 1.5396825396825398) internal successors, (194), 185 states have internal predecessors, (194), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2025-02-08 07:41:06,531 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 43 [2025-02-08 07:41:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:06,532 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2025-02-08 07:41:06,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-08 07:41:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2025-02-08 07:41:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:41:06,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:06,537 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:06,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:41:06,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2145879164, now seen corresponding path program 1 times [2025-02-08 07:41:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641898237] [2025-02-08 07:41:06,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:06,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:41:06,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:41:06,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:06,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:07,301 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-08 07:41:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641898237] [2025-02-08 07:41:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641898237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153494257] [2025-02-08 07:41:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:07,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:07,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:07,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:07,303 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-08 07:41:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:08,236 INFO L93 Difference]: Finished difference Result 264 states and 282 transitions. [2025-02-08 07:41:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:08,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2025-02-08 07:41:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:08,238 INFO L225 Difference]: With dead ends: 264 [2025-02-08 07:41:08,238 INFO L226 Difference]: Without dead ends: 264 [2025-02-08 07:41:08,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:08,239 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 248 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:08,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 544 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:41:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-08 07:41:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 193. [2025-02-08 07:41:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 184 states have internal predecessors, (193), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2025-02-08 07:41:08,245 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 43 [2025-02-08 07:41:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2025-02-08 07:41:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-08 07:41:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2025-02-08 07:41:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:41:08,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:08,246 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:08,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:41:08,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:08,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1593370001, now seen corresponding path program 1 times [2025-02-08 07:41:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:08,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729630999] [2025-02-08 07:41:08,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:08,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:41:08,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:41:08,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:08,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:08,717 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-08 07:41:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729630999] [2025-02-08 07:41:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729630999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:08,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198265389] [2025-02-08 07:41:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:08,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:08,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:08,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:08,719 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-08 07:41:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:11,509 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2025-02-08 07:41:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:11,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:41:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:11,510 INFO L225 Difference]: With dead ends: 212 [2025-02-08 07:41:11,511 INFO L226 Difference]: Without dead ends: 212 [2025-02-08 07:41:11,511 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-08 07:41:11,511 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 122 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:11,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 325 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 07:41:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-08 07:41:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2025-02-08 07:41:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 140 states have (on average 1.5357142857142858) internal successors, (215), 198 states have internal predecessors, (215), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2025-02-08 07:41:11,515 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 46 [2025-02-08 07:41:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:11,515 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2025-02-08 07:41:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-08 07:41:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2025-02-08 07:41:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:41:11,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:11,516 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:41:11,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1593369072, now seen corresponding path program 1 times [2025-02-08 07:41:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626525127] [2025-02-08 07:41:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:11,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:41:11,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:41:11,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,741 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-08 07:41:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:11,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626525127] [2025-02-08 07:41:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626525127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:11,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:11,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:11,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601177398] [2025-02-08 07:41:11,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:11,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:11,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:11,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:11,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:11,743 INFO L87 Difference]: Start difference. First operand 207 states and 226 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-08 07:41:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:13,342 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2025-02-08 07:41:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 46 [2025-02-08 07:41:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:13,343 INFO L225 Difference]: With dead ends: 204 [2025-02-08 07:41:13,343 INFO L226 Difference]: Without dead ends: 204 [2025-02-08 07:41:13,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:13,343 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:13,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 217 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 07:41:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-08 07:41:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-08 07:41:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 195 states have internal predecessors, (212), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2025-02-08 07:41:13,347 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 46 [2025-02-08 07:41:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:13,347 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2025-02-08 07:41:13,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-08 07:41:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2025-02-08 07:41:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:41:13,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:13,348 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:13,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:41:13,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1593369073, now seen corresponding path program 1 times [2025-02-08 07:41:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865731437] [2025-02-08 07:41:13,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:13,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:41:13,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:41:13,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:13,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:13,719 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-08 07:41:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:13,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865731437] [2025-02-08 07:41:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865731437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:13,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:41:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742838000] [2025-02-08 07:41:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:13,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:13,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:13,722 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-08 07:41:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,406 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2025-02-08 07:41:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:41:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,407 INFO L225 Difference]: With dead ends: 209 [2025-02-08 07:41:14,407 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 07:41:14,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:14,408 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 147 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 608 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 07:41:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 07:41:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2025-02-08 07:41:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 195 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2025-02-08 07:41:14,417 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 46 [2025-02-08 07:41:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2025-02-08 07:41:14,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-08 07:41:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2025-02-08 07:41:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:41:14,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,419 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] [2025-02-08 07:41:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:41:14,419 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:14,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash 107568310, now seen corresponding path program 1 times [2025-02-08 07:41:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164820500] [2025-02-08 07:41:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:41:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:41:14,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:14,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-08 07:41:14,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:14,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164820500] [2025-02-08 07:41:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164820500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:14,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:14,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:14,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250160853] [2025-02-08 07:41:14,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:14,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:14,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:14,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:14,762 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 07:41:15,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:16,029 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2025-02-08 07:41:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-02-08 07:41:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:16,031 INFO L225 Difference]: With dead ends: 203 [2025-02-08 07:41:16,031 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 07:41:16,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:16,031 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 97 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:16,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 160 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:41:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 07:41:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 07:41:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 194 states have internal predecessors, (209), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2025-02-08 07:41:16,040 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 49 [2025-02-08 07:41:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2025-02-08 07:41:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 07:41:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2025-02-08 07:41:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:41:16,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:16,041 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] [2025-02-08 07:41:16,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:41:16,041 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash 107568311, now seen corresponding path program 1 times [2025-02-08 07:41:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157140855] [2025-02-08 07:41:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:16,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:41:16,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:41:16,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:16,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:16,784 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-08 07:41:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157140855] [2025-02-08 07:41:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157140855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 07:41:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098355907] [2025-02-08 07:41:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:16,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 07:41:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:16,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 07:41:16,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:16,785 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-08 07:41:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:19,557 INFO L93 Difference]: Finished difference Result 275 states and 294 transitions. [2025-02-08 07:41:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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 49 [2025-02-08 07:41:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:19,559 INFO L225 Difference]: With dead ends: 275 [2025-02-08 07:41:19,559 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 07:41:19,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:41:19,559 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 312 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:19,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 373 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 07:41:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 07:41:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 203. [2025-02-08 07:41:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 194 states have internal predecessors, (208), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2025-02-08 07:41:19,564 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 49 [2025-02-08 07:41:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:19,564 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2025-02-08 07:41:19,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-08 07:41:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2025-02-08 07:41:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:41:19,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:19,565 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:41:19,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:19,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 522367145, now seen corresponding path program 1 times [2025-02-08 07:41:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747495642] [2025-02-08 07:41:19,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:19,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:41:19,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:41:19,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:19,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:20,103 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-08 07:41:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747495642] [2025-02-08 07:41:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747495642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:41:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428891510] [2025-02-08 07:41:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:20,105 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-08 07:41:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:22,317 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2025-02-08 07:41:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-02-08 07:41:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:22,318 INFO L225 Difference]: With dead ends: 202 [2025-02-08 07:41:22,318 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 07:41:22,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:22,319 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 101 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:22,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 501 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 07:41:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 07:41:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 07:41:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 140 states have (on average 1.4714285714285715) internal successors, (206), 193 states have internal predecessors, (206), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2025-02-08 07:41:22,322 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 52 [2025-02-08 07:41:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:22,323 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2025-02-08 07:41:22,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-08 07:41:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2025-02-08 07:41:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:41:22,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:22,323 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:22,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:41:22,323 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:22,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 522367146, now seen corresponding path program 1 times [2025-02-08 07:41:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187865623] [2025-02-08 07:41:22,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:22,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:41:22,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:41:22,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187865623] [2025-02-08 07:41:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187865623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:22,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:41:22,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613851067] [2025-02-08 07:41:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:22,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:22,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:22,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:22,902 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-08 07:41:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:24,759 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2025-02-08 07:41:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:24,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-02-08 07:41:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:24,760 INFO L225 Difference]: With dead ends: 201 [2025-02-08 07:41:24,760 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 07:41:24,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:24,761 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 98 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:24,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 450 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 07:41:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 07:41:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-08 07:41:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 140 states have (on average 1.457142857142857) internal successors, (204), 192 states have internal predecessors, (204), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 215 transitions. [2025-02-08 07:41:24,764 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 215 transitions. Word has length 52 [2025-02-08 07:41:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:24,764 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 215 transitions. [2025-02-08 07:41:24,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-08 07:41:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 215 transitions. [2025-02-08 07:41:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 07:41:24,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:24,765 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:24,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:41:24,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2020091805, now seen corresponding path program 1 times [2025-02-08 07:41:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879952403] [2025-02-08 07:41:24,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 07:41:24,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 07:41:24,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:24,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:24,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879952403] [2025-02-08 07:41:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879952403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:24,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358484444] [2025-02-08 07:41:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:24,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:24,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:24,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:24,937 INFO L87 Difference]: Start difference. First operand 201 states and 215 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-08 07:41:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:25,928 INFO L93 Difference]: Finished difference Result 213 states and 230 transitions. [2025-02-08 07:41:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 56 [2025-02-08 07:41:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:25,930 INFO L225 Difference]: With dead ends: 213 [2025-02-08 07:41:25,930 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 07:41:25,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:25,931 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:25,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:41:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 07:41:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2025-02-08 07:41:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 142 states have (on average 1.4507042253521127) internal successors, (206), 194 states have internal predecessors, (206), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2025-02-08 07:41:25,935 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 56 [2025-02-08 07:41:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:25,935 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2025-02-08 07:41:25,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-08 07:41:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2025-02-08 07:41:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:41:25,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:25,935 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:25,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:41:25,936 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:25,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1801416724, now seen corresponding path program 1 times [2025-02-08 07:41:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894649733] [2025-02-08 07:41:25,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:26,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:41:26,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:41:26,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:26,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:26,571 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-08 07:41:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894649733] [2025-02-08 07:41:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894649733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:26,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 07:41:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921695504] [2025-02-08 07:41:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:26,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 07:41:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 07:41:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:41:26,573 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:30,711 INFO L93 Difference]: Finished difference Result 210 states and 226 transitions. [2025-02-08 07:41:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:30,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 07:41:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:30,712 INFO L225 Difference]: With dead ends: 210 [2025-02-08 07:41:30,712 INFO L226 Difference]: Without dead ends: 210 [2025-02-08 07:41:30,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:41:30,713 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 106 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 658 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 07:41:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-08 07:41:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2025-02-08 07:41:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 200 states have internal predecessors, (215), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2025-02-08 07:41:30,716 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 57 [2025-02-08 07:41:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:30,717 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2025-02-08 07:41:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2025-02-08 07:41:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:41:30,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:30,717 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:30,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:41:30,717 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1801416723, now seen corresponding path program 1 times [2025-02-08 07:41:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299470140] [2025-02-08 07:41:30,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:30,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:41:30,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:41:30,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:31,622 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-08 07:41:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299470140] [2025-02-08 07:41:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299470140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:31,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:41:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578645546] [2025-02-08 07:41:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:41:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:41:31,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:41:31,625 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:32,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:34,578 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2025-02-08 07:41:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-08 07:41:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:34,579 INFO L225 Difference]: With dead ends: 209 [2025-02-08 07:41:34,579 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 07:41:34,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:41:34,580 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 108 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:34,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 401 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 07:41:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 07:41:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-08 07:41:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.4391891891891893) internal successors, (213), 200 states have internal predecessors, (213), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 224 transitions. [2025-02-08 07:41:34,585 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 224 transitions. Word has length 57 [2025-02-08 07:41:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:34,585 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 224 transitions. [2025-02-08 07:41:34,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 224 transitions. [2025-02-08 07:41:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 07:41:34,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:34,585 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:34,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 07:41:34,588 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 831165961, now seen corresponding path program 1 times [2025-02-08 07:41:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667570645] [2025-02-08 07:41:34,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:34,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:41:34,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:41:34,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:34,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:34,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667570645] [2025-02-08 07:41:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667570645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338787709] [2025-02-08 07:41:34,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:34,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:34,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:34,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:41:35,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:41:35,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:41:35,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:35,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:35,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:41:35,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:35,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338787709] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:35,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:41:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879708382] [2025-02-08 07:41:35,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:35,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:35,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:35,377 INFO L87 Difference]: Start difference. First operand 209 states and 224 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-08 07:41:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:37,202 INFO L93 Difference]: Finished difference Result 238 states and 258 transitions. [2025-02-08 07:41:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:37,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 61 [2025-02-08 07:41:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:37,203 INFO L225 Difference]: With dead ends: 238 [2025-02-08 07:41:37,203 INFO L226 Difference]: Without dead ends: 238 [2025-02-08 07:41:37,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:37,204 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 17 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:37,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 643 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 07:41:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-08 07:41:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2025-02-08 07:41:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 172 states have (on average 1.436046511627907) internal successors, (247), 224 states have internal predecessors, (247), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2025-02-08 07:41:37,211 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 61 [2025-02-08 07:41:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:37,211 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2025-02-08 07:41:37,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-08 07:41:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2025-02-08 07:41:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:41:37,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:37,212 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:37,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:41:37,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 07:41:37,417 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:37,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash -3412224, now seen corresponding path program 1 times [2025-02-08 07:41:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043126094] [2025-02-08 07:41:37,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:37,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:41:37,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:41:37,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:37,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043126094] [2025-02-08 07:41:38,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043126094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612021117] [2025-02-08 07:41:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:38,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:38,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:38,056 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:38,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:41:38,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:41:38,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:41:38,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:38,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:38,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 07:41:38,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:38,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:41:38,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:38,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:38,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:41:38,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2025-02-08 07:41:38,655 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:41:38,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-08 07:41:38,739 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:41:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-08 07:41:38,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-08 07:41:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 07:41:38,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:38,869 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-02-08 07:41:38,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-02-08 07:41:38,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array Int Int)) (v_ArrVal_4678 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem203#1.base| (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4678)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) is different from false [2025-02-08 07:41:38,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array Int Int)) (v_ArrVal_4678 (Array Int Int))) (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4678)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2)))) is different from false [2025-02-08 07:41:38,904 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4676 (Array Int Int)) (v_ArrVal_4677 (Array Int Int)) (v_ArrVal_4678 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4676)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4677))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_4678)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) is different from false [2025-02-08 07:41:38,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:38,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 80 [2025-02-08 07:41:38,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5348 treesize of output 4268 [2025-02-08 07:41:39,046 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 495 treesize of output 399 [2025-02-08 07:41:39,058 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 399 treesize of output 303 [2025-02-08 07:41:39,066 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 303 treesize of output 255 [2025-02-08 07:41:39,130 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:41:39,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:41:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612021117] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:39,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2025-02-08 07:41:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185671619] [2025-02-08 07:41:39,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:39,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:41:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:39,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:41:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=219, Unknown=9, NotChecked=96, Total=380 [2025-02-08 07:41:39,146 INFO L87 Difference]: Start difference. First operand 233 states and 258 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-08 07:41:40,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:45,622 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2025-02-08 07:41:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:45,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 07:41:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:45,623 INFO L225 Difference]: With dead ends: 232 [2025-02-08 07:41:45,623 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 07:41:45,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=359, Unknown=9, NotChecked=126, Total=600 [2025-02-08 07:41:45,624 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 197 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:45,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1029 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 554 Invalid, 0 Unknown, 339 Unchecked, 6.4s Time] [2025-02-08 07:41:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 07:41:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-08 07:41:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 172 states have (on average 1.4011627906976745) internal successors, (241), 223 states have internal predecessors, (241), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2025-02-08 07:41:45,628 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 62 [2025-02-08 07:41:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2025-02-08 07:41:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-08 07:41:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2025-02-08 07:41:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:41:45,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:45,629 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:45,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:41:45,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 07:41:45,833 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:41:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash -3412223, now seen corresponding path program 1 times [2025-02-08 07:41:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:45,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463728929] [2025-02-08 07:41:45,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:45,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:41:45,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:41:45,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:45,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463728929] [2025-02-08 07:41:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463728929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606408452] [2025-02-08 07:41:46,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:46,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:46,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:46,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:46,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:41:47,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:41:47,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:41:47,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:47,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 07:41:47,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:47,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:41:47,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:47,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:47,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:41:47,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:41:47,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:41:47,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:41:47,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:41:47,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:47,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2025-02-08 07:41:47,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:41:47,837 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:41:47,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:41:47,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:41:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-08 07:41:47,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:41:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:47,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:48,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~mem203#1.offset| 10))) (and (forall ((v_ArrVal_5112 (Array Int Int))) (or (forall ((v_ArrVal_5113 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5113))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_5114 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5112) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (< .cse0 0))))) (not (= (store .cse3 .cse4 (select v_ArrVal_5112 .cse4)) v_ArrVal_5112)))) (forall ((v_ArrVal_5112 (Array Int Int))) (or (forall ((v_ArrVal_5113 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5113))) (or (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5112))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_5114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_5115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 0)))) (not (= (store .cse3 .cse4 (select v_ArrVal_5112 .cse4)) v_ArrVal_5112)))))) is different from false [2025-02-08 07:41:48,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem203#1.offset_12| Int)) (or (forall ((v_ArrVal_5112 (Array Int Int))) (or (forall ((v_ArrVal_5113 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5113))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0) (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5112))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 v_ArrVal_5114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) (not (= (let ((.cse6 (+ |v_ULTIMATE.start_main_#t~mem203#1.offset_12| 10))) (store .cse5 .cse6 (select v_ArrVal_5112 .cse6))) v_ArrVal_5112)))) (< |v_ULTIMATE.start_main_#t~mem203#1.offset_12| .cse7))) (forall ((|v_ULTIMATE.start_main_#t~mem203#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem203#1.offset_12| .cse7) (forall ((v_ArrVal_5112 (Array Int Int))) (or (not (= (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem203#1.offset_12| 10))) (store .cse5 .cse8 (select v_ArrVal_5112 .cse8))) v_ArrVal_5112)) (forall ((v_ArrVal_5113 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5113))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< .cse9 0) (forall ((v_ArrVal_5114 (Array Int Int))) (< .cse9 (+ (select (select (store .cse10 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5112) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))))))))))))))) is different from false [2025-02-08 07:41:48,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5110 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem203#1.offset_12| Int) (v_ArrVal_5111 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5110))) (or (< |v_ULTIMATE.start_main_#t~mem203#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_ArrVal_5112 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5111))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem203#1.offset_12| 10))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_5112 .cse4))) v_ArrVal_5112)) (forall ((v_ArrVal_5113 (Array Int Int))) (let ((.cse5 (store .cse0 .cse3 v_ArrVal_5113))) (or (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (let ((.cse7 (store .cse2 .cse3 v_ArrVal_5112))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_5114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_5115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (< (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0))))))))))) (forall ((v_ArrVal_5110 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem203#1.offset_12| Int) (v_ArrVal_5111 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5110))) (or (forall ((v_ArrVal_5112 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5111))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (= (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem203#1.offset_12| 10))) (store (select .cse8 .cse9) .cse10 (select v_ArrVal_5112 .cse10))) v_ArrVal_5112)) (forall ((v_ArrVal_5113 (Array Int Int))) (let ((.cse12 (store .cse13 .cse9 v_ArrVal_5113))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5114 (Array Int Int))) (< .cse11 (+ (select (select (store .cse12 (select (select (store .cse8 .cse9 v_ArrVal_5112) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (< .cse11 0))))))))) (< |v_ULTIMATE.start_main_#t~mem203#1.offset_12| (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:41:48,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:48,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 198 [2025-02-08 07:41:48,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:48,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 153 [2025-02-08 07:41:48,678 INFO L349 Elim1Store]: treesize reduction 14, result has 62.2 percent of original size [2025-02-08 07:41:48,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1373 treesize of output 1331 [2025-02-08 07:41:48,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68957 treesize of output 63021 [2025-02-08 07:41:48,818 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 571 treesize of output 499 [2025-02-08 07:41:48,830 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 590 treesize of output 530 [2025-02-08 07:41:48,859 INFO L349 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size [2025-02-08 07:41:48,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 613 treesize of output 538 [2025-02-08 07:41:48,874 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 436 treesize of output 412 [2025-02-08 07:41:48,909 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 07:41:48,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:48,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-02-08 07:41:49,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:49,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-02-08 07:41:49,037 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-08 07:41:49,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-02-08 07:41:49,210 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 63 treesize of output 45 [2025-02-08 07:41:49,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:49,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 264 [2025-02-08 07:41:49,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:49,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 183 [2025-02-08 07:41:49,233 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:41:49,239 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 07:41:49,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 641 treesize of output 585 [2025-02-08 07:41:49,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:41:49,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:41:49,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 175 [2025-02-08 07:41:49,256 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 64 treesize of output 58 [2025-02-08 07:41:49,260 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 58 treesize of output 52 [2025-02-08 07:41:49,263 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 135 treesize of output 99 [2025-02-08 07:41:49,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:49,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2025-02-08 07:41:49,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:49,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2025-02-08 07:41:49,284 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 12 treesize of output 8 [2025-02-08 07:41:49,289 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 12 treesize of output 8 [2025-02-08 07:41:49,374 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:41:49,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:41:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606408452] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:49,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-02-08 07:41:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680433602] [2025-02-08 07:41:49,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 07:41:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:49,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 07:41:49,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=929, Unknown=3, NotChecked=192, Total=1260 [2025-02-08 07:41:49,383 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 36 states have internal predecessors, (74), 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-08 07:42:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:02,109 INFO L93 Difference]: Finished difference Result 239 states and 255 transitions. [2025-02-08 07:42:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 07:42:02,110 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 36 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 07:42:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:02,111 INFO L225 Difference]: With dead ends: 239 [2025-02-08 07:42:02,111 INFO L226 Difference]: Without dead ends: 239 [2025-02-08 07:42:02,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=602, Invalid=2713, Unknown=3, NotChecked=342, Total=3660 [2025-02-08 07:42:02,112 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 510 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 47 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:02,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1513 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1582 Invalid, 18 Unknown, 534 Unchecked, 11.3s Time] [2025-02-08 07:42:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-08 07:42:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2025-02-08 07:42:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 229 states have internal predecessors, (244), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:42:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 255 transitions. [2025-02-08 07:42:02,117 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 255 transitions. Word has length 62 [2025-02-08 07:42:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 255 transitions. [2025-02-08 07:42:02,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 36 states have internal predecessors, (74), 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-08 07:42:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 255 transitions. [2025-02-08 07:42:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:42:02,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:02,118 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:02,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:42:02,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 07:42:02,322 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:42:02,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash 208801437, now seen corresponding path program 2 times [2025-02-08 07:42:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:02,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264725135] [2025-02-08 07:42:02,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:02,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-08 07:42:02,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:42:02,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:42:02,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:02,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264725135] [2025-02-08 07:42:02,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264725135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:02,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373358331] [2025-02-08 07:42:02,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:02,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:02,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:02,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:42:03,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-08 07:42:09,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:42:09,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:42:09,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:09,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:42:09,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:09,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373358331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:10,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:42:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866250936] [2025-02-08 07:42:10,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:42:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:10,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:42:10,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:42:10,060 INFO L87 Difference]: Start difference. First operand 238 states and 255 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-08 07:42:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:10,555 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2025-02-08 07:42:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:42:10,555 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 76 [2025-02-08 07:42:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:10,556 INFO L225 Difference]: With dead ends: 301 [2025-02-08 07:42:10,556 INFO L226 Difference]: Without dead ends: 301 [2025-02-08 07:42:10,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 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-08 07:42:10,557 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 39 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:10,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 348 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:42:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-08 07:42:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2025-02-08 07:42:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 232 states have (on average 1.3491379310344827) internal successors, (313), 283 states have internal predecessors, (313), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:42:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 324 transitions. [2025-02-08 07:42:10,561 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 324 transitions. Word has length 76 [2025-02-08 07:42:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:10,561 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 324 transitions. [2025-02-08 07:42:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-08 07:42:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 324 transitions. [2025-02-08 07:42:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 07:42:10,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:10,562 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:10,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 07:42:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:10,762 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-02-08 07:42:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2116843283, now seen corresponding path program 2 times [2025-02-08 07:42:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787849371] [2025-02-08 07:42:10,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:10,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-08 07:42:10,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 07:42:10,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:42:10,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787849371] [2025-02-08 07:42:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787849371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903752958] [2025-02-08 07:42:12,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:12,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:12,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:12,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:12,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:42:12,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-08 07:42:17,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 07:42:17,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:42:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:17,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 07:42:17,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:17,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 07:42:17,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:42:17,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:42:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:42:17,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:42:17,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:42:17,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:42:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:42:17,419 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:17,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:42:17,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:42:17,519 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:17,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:42:17,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:42:17,654 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:17,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:42:17,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:42:17,776 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:17,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:42:17,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:42:17,890 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:17,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:42:17,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:42:17,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-08 07:42:17,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:42:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:17,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:18,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_6059 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2025-02-08 07:42:18,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_6059 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2025-02-08 07:42:18,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6059 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:42:18,116 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6057))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6058) .cse0 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6058) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2025-02-08 07:42:18,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6058) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6057))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6058) .cse2 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:42:18,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6058) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6057))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6058) .cse2 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:42:18,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6055))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6056) .cse0 v_ArrVal_6058) (select (select (store .cse1 .cse0 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_6059))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6055))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_6057))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6056) .cse3 v_ArrVal_6058) .cse4 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:42:18,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6055))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_6057))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6056) .cse1 v_ArrVal_6058) .cse2 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6055))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6056) .cse6 v_ArrVal_6058) (select (select (store .cse7 .cse6 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_6059))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2025-02-08 07:42:18,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6055))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6056) .cse1 v_ArrVal_6058) (select (select (store .cse2 .cse1 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_6059))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6055))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6057))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6056) .cse4 v_ArrVal_6058) .cse5 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 07:42:18,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6053))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_6055))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6054) .cse0 v_ArrVal_6056) .cse1 v_ArrVal_6058) (select (select (store .cse2 .cse1 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_6059))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6053))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_6055))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_6057))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_6054) .cse5 v_ArrVal_6056) .cse6 v_ArrVal_6058) .cse7 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-02-08 07:42:18,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6053))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_6055))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_6057))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6054) .cse1 v_ArrVal_6056) .cse2 v_ArrVal_6058) .cse3 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6053))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_6055))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6054) .cse8 v_ArrVal_6056) .cse9 v_ArrVal_6058) (select (select (store .cse10 .cse9 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_6059))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4)))))) is different from false [2025-02-08 07:42:18,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6052 (Array Int Int)) (v_ArrVal_6051 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_6051))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_6053))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_6055))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_6052) .cse0 v_ArrVal_6054) .cse1 v_ArrVal_6056) .cse2 v_ArrVal_6058) (select (select (store .cse3 .cse2 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_6059))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int)) (v_ArrVal_6052 (Array Int Int)) (v_ArrVal_6051 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_6051))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_6053))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_6055))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_6057))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 5 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_6052) .cse7 v_ArrVal_6054) .cse8 v_ArrVal_6056) .cse9 v_ArrVal_6058) .cse10 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2025-02-08 07:42:18,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6052 (Array Int Int)) (v_ArrVal_6051 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6051))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_6053))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_6055))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6052) .cse1 v_ArrVal_6054) .cse2 v_ArrVal_6056) .cse3 v_ArrVal_6058) (select (select (store .cse4 .cse3 v_ArrVal_6057) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_6059))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4))) (forall ((v_ArrVal_6056 (Array Int Int)) (v_ArrVal_6055 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6057 (Array Int Int)) (v_ArrVal_6059 (Array Int Int)) (v_ArrVal_6060 (Array Int Int)) (v_ArrVal_6052 (Array Int Int)) (v_ArrVal_6051 (Array Int Int)) (v_ArrVal_6054 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6051))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_6053))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_6055))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_6057))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ 5 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6052) .cse8 v_ArrVal_6054) .cse9 v_ArrVal_6056) .cse10 v_ArrVal_6058) .cse11 v_ArrVal_6059) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_6060) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))))))) is different from false