./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:13:33,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:13:33,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:13:33,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:13:33,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:13:33,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:13:33,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:13:33,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:13:33,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:13:33,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:13:33,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:13:33,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:13:33,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:13:33,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:13:33,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:13:33,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:13:33,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:13:33,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:13:33,273 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:13:33,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:33,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:13:33,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:13:33,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:13:33,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:13:33,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:13:33,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a [2025-03-04 09:13:33,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:13:33,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:13:33,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:13:33,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:13:33,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:13:33,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-03-04 09:13:34,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4ef03b0/e15b3c7bcb234dbfa8378b3170f0eeec/FLAGcc63180b4 [2025-03-04 09:13:35,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:13:35,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-03-04 09:13:35,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4ef03b0/e15b3c7bcb234dbfa8378b3170f0eeec/FLAGcc63180b4 [2025-03-04 09:13:35,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4ef03b0/e15b3c7bcb234dbfa8378b3170f0eeec [2025-03-04 09:13:35,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:13:35,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:13:35,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:35,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:13:35,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:13:35,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:35" (1/1) ... [2025-03-04 09:13:35,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ab995f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:35, skipping insertion in model container [2025-03-04 09:13:35,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:35" (1/1) ... [2025-03-04 09:13:35,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:13:35,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,727 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,730 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,730 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,731 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,732 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,733 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,735 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,741 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,742 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,750 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,751 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,756 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,770 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,779 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:13:35,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:35,812 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:13:35,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:36,030 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:13:36,036 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:13:36,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36 WrapperNode [2025-03-04 09:13:36,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:36,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:36,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:13:36,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:13:36,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,131 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 996 [2025-03-04 09:13:36,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:36,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:13:36,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:13:36,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:13:36,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,174 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 09:13:36,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:13:36,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:13:36,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:13:36,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:13:36,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (1/1) ... [2025-03-04 09:13:36,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:36,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:36,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:13:36,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-03-04 09:13:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:13:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 09:13:36,291 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 09:13:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-04 09:13:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-04 09:13:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:13:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:13:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:13:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 09:13:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 09:13:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 09:13:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 09:13:36,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:13:36,599 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:13:38,210 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579: havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset; [2025-03-04 09:13:38,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: havoc getuid_#t~nondet148#1; [2025-03-04 09:13:38,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc find_applet_by_name_#t~nondet78#1; [2025-03-04 09:13:38,283 INFO L? ?]: Removed 465 outVars from TransFormulas that were not future-live. [2025-03-04 09:13:38,283 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:13:38,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:13:38,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:13:38,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:13:38 BoogieIcfgContainer [2025-03-04 09:13:38,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:13:38,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:13:38,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:13:38,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:13:38,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:13:35" (1/3) ... [2025-03-04 09:13:38,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed6790a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:13:38, skipping insertion in model container [2025-03-04 09:13:38,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:36" (2/3) ... [2025-03-04 09:13:38,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed6790a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:13:38, skipping insertion in model container [2025-03-04 09:13:38,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:13:38" (3/3) ... [2025-03-04 09:13:38,322 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2025-03-04 09:13:38,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:13:38,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 437 locations, 1 initial locations, 12 loop locations, and 177 error locations. [2025-03-04 09:13:38,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:13:38,399 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;@6fcbdf7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:13:38,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 177 error locations. [2025-03-04 09:13:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 437 states, 242 states have (on average 1.9297520661157024) internal successors, (467), 421 states have internal predecessors, (467), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 09:13:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:13:38,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:38,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:13:38,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:38,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash 552075, now seen corresponding path program 1 times [2025-03-04 09:13:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024175691] [2025-03-04 09:13:38,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:13:38,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:13:38,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:38,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:39,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024175691] [2025-03-04 09:13:39,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024175691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:39,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:39,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001385057] [2025-03-04 09:13:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:39,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:39,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:39,133 INFO L87 Difference]: Start difference. First operand has 437 states, 242 states have (on average 1.9297520661157024) internal successors, (467), 421 states have internal predecessors, (467), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:39,879 INFO L93 Difference]: Finished difference Result 289 states and 314 transitions. [2025-03-04 09:13:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:13:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:39,888 INFO L225 Difference]: With dead ends: 289 [2025-03-04 09:13:39,888 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 09:13:39,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:39,892 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 211 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:39,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 250 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 09:13:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 09:13:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 271. [2025-03-04 09:13:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 150 states have (on average 1.8666666666666667) internal successors, (280), 261 states have internal predecessors, (280), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 295 transitions. [2025-03-04 09:13:39,931 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 295 transitions. Word has length 3 [2025-03-04 09:13:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:39,931 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 295 transitions. [2025-03-04 09:13:39,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 295 transitions. [2025-03-04 09:13:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:13:39,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:39,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:13:39,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:13:39,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash 552076, now seen corresponding path program 1 times [2025-03-04 09:13:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658379183] [2025-03-04 09:13:39,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:13:40,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:13:40,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:40,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658379183] [2025-03-04 09:13:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658379183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91493291] [2025-03-04 09:13:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:40,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:40,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:40,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:40,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:40,327 INFO L87 Difference]: Start difference. First operand 271 states and 295 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:40,926 INFO L93 Difference]: Finished difference Result 270 states and 294 transitions. [2025-03-04 09:13:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:13:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:40,928 INFO L225 Difference]: With dead ends: 270 [2025-03-04 09:13:40,928 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 09:13:40,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:40,929 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 10 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:40,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 462 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 09:13:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 09:13:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-04 09:13:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 150 states have (on average 1.86) internal successors, (279), 260 states have internal predecessors, (279), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 294 transitions. [2025-03-04 09:13:40,940 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 294 transitions. Word has length 3 [2025-03-04 09:13:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:40,940 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 294 transitions. [2025-03-04 09:13:40,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2025-03-04 09:13:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:13:40,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:40,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:13:40,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:13:40,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:40,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -732515491, now seen corresponding path program 1 times [2025-03-04 09:13:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534996589] [2025-03-04 09:13:40,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:13:41,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:13:41,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:41,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:41,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534996589] [2025-03-04 09:13:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534996589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838936235] [2025-03-04 09:13:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:41,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:41,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:41,215 INFO L87 Difference]: Start difference. First operand 270 states and 294 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:41,233 INFO L93 Difference]: Finished difference Result 273 states and 298 transitions. [2025-03-04 09:13:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:13:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:41,234 INFO L225 Difference]: With dead ends: 273 [2025-03-04 09:13:41,234 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 09:13:41,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:41,235 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 2 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:41,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 577 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 09:13:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2025-03-04 09:13:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 151 states have (on average 1.8543046357615893) internal successors, (280), 261 states have internal predecessors, (280), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 295 transitions. [2025-03-04 09:13:41,247 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 295 transitions. Word has length 6 [2025-03-04 09:13:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 295 transitions. [2025-03-04 09:13:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 295 transitions. [2025-03-04 09:13:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:13:41,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:41,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:13:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:13:41,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:41,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -732515330, now seen corresponding path program 1 times [2025-03-04 09:13:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018492720] [2025-03-04 09:13:41,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:41,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:13:41,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:13:41,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:41,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:41,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:41,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018492720] [2025-03-04 09:13:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018492720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906426162] [2025-03-04 09:13:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:41,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:41,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:41,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:41,603 INFO L87 Difference]: Start difference. First operand 271 states and 295 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:42,534 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2025-03-04 09:13:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:13:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:13:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:42,535 INFO L225 Difference]: With dead ends: 273 [2025-03-04 09:13:42,535 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 09:13:42,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:42,536 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 11 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:42,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 462 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:13:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 09:13:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2025-03-04 09:13:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 152 states have (on average 1.8486842105263157) internal successors, (281), 262 states have internal predecessors, (281), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 296 transitions. [2025-03-04 09:13:42,548 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 296 transitions. Word has length 6 [2025-03-04 09:13:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:42,548 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 296 transitions. [2025-03-04 09:13:42,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 296 transitions. [2025-03-04 09:13:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:13:42,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:42,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:42,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:13:42,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:42,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash 365087718, now seen corresponding path program 1 times [2025-03-04 09:13:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:42,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065339638] [2025-03-04 09:13:42,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:42,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:42,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:42,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:42,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:42,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065339638] [2025-03-04 09:13:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065339638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307614541] [2025-03-04 09:13:42,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:42,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:42,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:42,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:42,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:13:43,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:43,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:43,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:13:43,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:43,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307614541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:43,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:13:43,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319986218] [2025-03-04 09:13:43,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:43,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:43,205 INFO L87 Difference]: Start difference. First operand 272 states and 296 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:43,245 INFO L93 Difference]: Finished difference Result 280 states and 306 transitions. [2025-03-04 09:13:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:13:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:43,247 INFO L225 Difference]: With dead ends: 280 [2025-03-04 09:13:43,247 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 09:13:43,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:43,248 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 4 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:43,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1151 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 09:13:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-04 09:13:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 160 states have (on average 1.81875) internal successors, (291), 270 states have internal predecessors, (291), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 306 transitions. [2025-03-04 09:13:43,254 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 306 transitions. Word has length 9 [2025-03-04 09:13:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:43,254 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 306 transitions. [2025-03-04 09:13:43,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 306 transitions. [2025-03-04 09:13:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:13:43,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:43,255 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:43,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:13:43,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:43,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:43,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 365087879, now seen corresponding path program 1 times [2025-03-04 09:13:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839825755] [2025-03-04 09:13:43,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:43,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:43,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:43,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:43,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:43,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:43,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839825755] [2025-03-04 09:13:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839825755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267661878] [2025-03-04 09:13:43,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:43,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:43,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:43,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:43,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:13:44,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:13:44,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:13:44,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:44,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:44,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:13:44,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:44,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:44,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 09:13:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267661878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:44,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:13:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676438696] [2025-03-04 09:13:44,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:13:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:44,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:13:44,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:13:44,371 INFO L87 Difference]: Start difference. First operand 280 states and 306 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:46,488 INFO L93 Difference]: Finished difference Result 279 states and 303 transitions. [2025-03-04 09:13:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:13:46,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:13:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:46,490 INFO L225 Difference]: With dead ends: 279 [2025-03-04 09:13:46,490 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 09:13:46,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:13:46,490 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 454 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:46,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1513 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 09:13:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 09:13:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-04 09:13:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 160 states have (on average 1.8) internal successors, (288), 269 states have internal predecessors, (288), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 303 transitions. [2025-03-04 09:13:46,495 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 303 transitions. Word has length 9 [2025-03-04 09:13:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:46,496 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 303 transitions. [2025-03-04 09:13:46,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 303 transitions. [2025-03-04 09:13:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:13:46,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:46,496 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:46,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:13:46,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 09:13:46,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -215336419, now seen corresponding path program 2 times [2025-03-04 09:13:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127311876] [2025-03-04 09:13:46,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:46,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:13:46,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 09:13:46,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:13:46,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 09:13:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127311876] [2025-03-04 09:13:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127311876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486806747] [2025-03-04 09:13:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:47,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:47,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:47,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:47,057 INFO L87 Difference]: Start difference. First operand 279 states and 303 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:47,213 INFO L93 Difference]: Finished difference Result 294 states and 319 transitions. [2025-03-04 09:13:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:13:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:47,214 INFO L225 Difference]: With dead ends: 294 [2025-03-04 09:13:47,214 INFO L226 Difference]: Without dead ends: 294 [2025-03-04 09:13:47,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:47,215 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 255 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:47,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 228 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-04 09:13:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 278. [2025-03-04 09:13:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 160 states have (on average 1.79375) internal successors, (287), 268 states have internal predecessors, (287), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 302 transitions. [2025-03-04 09:13:47,220 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 302 transitions. Word has length 18 [2025-03-04 09:13:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:47,221 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 302 transitions. [2025-03-04 09:13:47,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 302 transitions. [2025-03-04 09:13:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:13:47,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:47,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:47,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:13:47,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash -215336418, now seen corresponding path program 1 times [2025-03-04 09:13:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:47,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260613583] [2025-03-04 09:13:47,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:47,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:47,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:13:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:13:47,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:47,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260613583] [2025-03-04 09:13:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260613583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:13:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555752911] [2025-03-04 09:13:47,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:47,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:47,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:47,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:13:47,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:13:47,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:13:47,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:13:47,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:47,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:47,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:13:47,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:13:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:47,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:13:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:13:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555752911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:13:47,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:13:47,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:13:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896947706] [2025-03-04 09:13:47,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:13:47,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:13:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:47,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:13:47,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:13:47,948 INFO L87 Difference]: Start difference. First operand 278 states and 302 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:47,994 INFO L93 Difference]: Finished difference Result 296 states and 320 transitions. [2025-03-04 09:13:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:13:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:13:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:47,995 INFO L225 Difference]: With dead ends: 296 [2025-03-04 09:13:47,995 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 09:13:47,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:13:47,996 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 4 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:47,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1433 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:13:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 09:13:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 09:13:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 286 states have internal predecessors, (305), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 320 transitions. [2025-03-04 09:13:48,003 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 320 transitions. Word has length 18 [2025-03-04 09:13:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:48,004 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 320 transitions. [2025-03-04 09:13:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 320 transitions. [2025-03-04 09:13:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:13:48,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:48,005 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:48,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:13:48,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:13:48,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:48,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1689728962, now seen corresponding path program 2 times [2025-03-04 09:13:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:48,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830577211] [2025-03-04 09:13:48,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:13:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:48,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:13:48,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:13:48,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:13:48,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:48,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:48,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830577211] [2025-03-04 09:13:48,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830577211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:48,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:48,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107703210] [2025-03-04 09:13:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:48,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:13:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:48,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:13:48,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:48,595 INFO L87 Difference]: Start difference. First operand 296 states and 320 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:49,388 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2025-03-04 09:13:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 09:13:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:49,389 INFO L225 Difference]: With dead ends: 311 [2025-03-04 09:13:49,389 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 09:13:49,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:49,390 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 761 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:49,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 176 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:13:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 09:13:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 295. [2025-03-04 09:13:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 178 states have (on average 1.7078651685393258) internal successors, (304), 285 states have internal predecessors, (304), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 319 transitions. [2025-03-04 09:13:49,397 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 319 transitions. Word has length 36 [2025-03-04 09:13:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:49,397 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 319 transitions. [2025-03-04 09:13:49,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:13:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 319 transitions. [2025-03-04 09:13:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:13:49,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:49,398 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:13:49,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1564078384, now seen corresponding path program 1 times [2025-03-04 09:13:49,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:49,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55697890] [2025-03-04 09:13:49,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:49,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:49,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:13:49,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:13:49,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:49,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:49,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55697890] [2025-03-04 09:13:49,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55697890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:49,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:49,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:13:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908532123] [2025-03-04 09:13:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:49,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:13:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:49,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:13:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:49,854 INFO L87 Difference]: Start difference. First operand 295 states and 319 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:50,813 INFO L93 Difference]: Finished difference Result 306 states and 331 transitions. [2025-03-04 09:13:50,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:13:50,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:13:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:50,815 INFO L225 Difference]: With dead ends: 306 [2025-03-04 09:13:50,815 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 09:13:50,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:13:50,816 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 191 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:50,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 252 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 09:13:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 09:13:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 290. [2025-03-04 09:13:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 178 states have (on average 1.6797752808988764) internal successors, (299), 280 states have internal predecessors, (299), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 314 transitions. [2025-03-04 09:13:50,824 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 314 transitions. Word has length 44 [2025-03-04 09:13:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:50,825 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 314 transitions. [2025-03-04 09:13:50,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 314 transitions. [2025-03-04 09:13:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:13:50,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:50,826 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:50,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:13:50,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:50,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1564078383, now seen corresponding path program 1 times [2025-03-04 09:13:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517748082] [2025-03-04 09:13:50,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:50,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:50,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:13:51,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:13:51,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:51,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517748082] [2025-03-04 09:13:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517748082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:13:51,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693991190] [2025-03-04 09:13:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:51,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:51,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:51,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:51,697 INFO L87 Difference]: Start difference. First operand 290 states and 314 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:52,539 INFO L93 Difference]: Finished difference Result 435 states and 479 transitions. [2025-03-04 09:13:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:13:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:52,541 INFO L225 Difference]: With dead ends: 435 [2025-03-04 09:13:52,541 INFO L226 Difference]: Without dead ends: 435 [2025-03-04 09:13:52,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:52,541 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 352 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:52,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 871 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 09:13:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-04 09:13:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 289. [2025-03-04 09:13:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 178 states have (on average 1.6741573033707866) internal successors, (298), 279 states have internal predecessors, (298), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 313 transitions. [2025-03-04 09:13:52,553 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 313 transitions. Word has length 44 [2025-03-04 09:13:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:52,554 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 313 transitions. [2025-03-04 09:13:52,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 313 transitions. [2025-03-04 09:13:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:13:52,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:52,556 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:52,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:13:52,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:52,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash 641528201, now seen corresponding path program 1 times [2025-03-04 09:13:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:52,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713050676] [2025-03-04 09:13:52,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:13:52,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:13:52,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:52,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713050676] [2025-03-04 09:13:53,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713050676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:53,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:53,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:13:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722684444] [2025-03-04 09:13:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:53,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:53,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:53,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:53,017 INFO L87 Difference]: Start difference. First operand 289 states and 313 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:53,324 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2025-03-04 09:13:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:13:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:53,326 INFO L225 Difference]: With dead ends: 317 [2025-03-04 09:13:53,326 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 09:13:53,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:53,326 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 468 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:53,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 387 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 09:13:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 09:13:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 302. [2025-03-04 09:13:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 192 states have (on average 1.6614583333333333) internal successors, (319), 292 states have internal predecessors, (319), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 334 transitions. [2025-03-04 09:13:53,334 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 334 transitions. Word has length 47 [2025-03-04 09:13:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:53,334 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 334 transitions. [2025-03-04 09:13:53,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 334 transitions. [2025-03-04 09:13:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:13:53,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:53,335 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:53,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:13:53,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 641527272, now seen corresponding path program 1 times [2025-03-04 09:13:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975723766] [2025-03-04 09:13:53,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:53,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:13:53,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:13:53,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:53,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975723766] [2025-03-04 09:13:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975723766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:13:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392422635] [2025-03-04 09:13:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:53,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:13:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:53,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:13:53,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:13:53,589 INFO L87 Difference]: Start difference. First operand 302 states and 334 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:54,951 INFO L93 Difference]: Finished difference Result 313 states and 346 transitions. [2025-03-04 09:13:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:13:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:13:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:54,957 INFO L225 Difference]: With dead ends: 313 [2025-03-04 09:13:54,957 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 09:13:54,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:13:54,958 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 298 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:54,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 325 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:13:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 09:13:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2025-03-04 09:13:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 192 states have (on average 1.6354166666666667) internal successors, (314), 287 states have internal predecessors, (314), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 329 transitions. [2025-03-04 09:13:54,966 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 329 transitions. Word has length 47 [2025-03-04 09:13:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:54,967 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 329 transitions. [2025-03-04 09:13:54,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 329 transitions. [2025-03-04 09:13:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:13:54,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:54,969 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:54,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:13:54,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:54,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash 641527273, now seen corresponding path program 1 times [2025-03-04 09:13:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686522617] [2025-03-04 09:13:54,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:55,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:13:55,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:13:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686522617] [2025-03-04 09:13:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686522617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38511496] [2025-03-04 09:13:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:13:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:55,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:13:55,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:55,351 INFO L87 Difference]: Start difference. First operand 297 states and 329 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:55,441 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2025-03-04 09:13:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:13:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:13:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:55,443 INFO L225 Difference]: With dead ends: 302 [2025-03-04 09:13:55,443 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 09:13:55,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:13:55,444 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 209 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:55,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1102 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:13:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 09:13:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2025-03-04 09:13:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 192 states have (on average 1.6302083333333333) internal successors, (313), 287 states have internal predecessors, (313), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 328 transitions. [2025-03-04 09:13:55,452 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 328 transitions. Word has length 47 [2025-03-04 09:13:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:55,453 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 328 transitions. [2025-03-04 09:13:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 328 transitions. [2025-03-04 09:13:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:13:55,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:55,455 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:55,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:13:55,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:55,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash -837394388, now seen corresponding path program 1 times [2025-03-04 09:13:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:55,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680121670] [2025-03-04 09:13:55,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:55,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:13:55,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:13:55,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:55,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:56,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:56,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680121670] [2025-03-04 09:13:56,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680121670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:56,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:56,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908651946] [2025-03-04 09:13:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:56,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:56,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:56,372 INFO L87 Difference]: Start difference. First operand 297 states and 328 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:13:59,076 INFO L93 Difference]: Finished difference Result 448 states and 496 transitions. [2025-03-04 09:13:59,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:13:59,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 09:13:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:13:59,078 INFO L225 Difference]: With dead ends: 448 [2025-03-04 09:13:59,078 INFO L226 Difference]: Without dead ends: 448 [2025-03-04 09:13:59,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:13:59,078 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 524 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:13:59,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 639 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 09:13:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-04 09:13:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 304. [2025-03-04 09:13:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 200 states have (on average 1.62) internal successors, (324), 294 states have internal predecessors, (324), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:13:59,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 339 transitions. [2025-03-04 09:13:59,084 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 339 transitions. Word has length 50 [2025-03-04 09:13:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:13:59,085 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 339 transitions. [2025-03-04 09:13:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:13:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 339 transitions. [2025-03-04 09:13:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:13:59,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:13:59,085 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:13:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:13:59,086 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:13:59,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:13:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1645727871, now seen corresponding path program 1 times [2025-03-04 09:13:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:13:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875192788] [2025-03-04 09:13:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:13:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:13:59,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:13:59,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:13:59,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:13:59,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:13:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:13:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:13:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875192788] [2025-03-04 09:13:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875192788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:13:59,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:13:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:13:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774391484] [2025-03-04 09:13:59,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:13:59,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:13:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:13:59,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:13:59,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:13:59,580 INFO L87 Difference]: Start difference. First operand 304 states and 339 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:01,094 INFO L93 Difference]: Finished difference Result 303 states and 337 transitions. [2025-03-04 09:14:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:14:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 09:14:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:01,095 INFO L225 Difference]: With dead ends: 303 [2025-03-04 09:14:01,095 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 09:14:01,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:14:01,096 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 184 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:01,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 753 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:14:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 09:14:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-04 09:14:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 200 states have (on average 1.61) internal successors, (322), 293 states have internal predecessors, (322), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 337 transitions. [2025-03-04 09:14:01,102 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 337 transitions. Word has length 53 [2025-03-04 09:14:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 337 transitions. [2025-03-04 09:14:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 337 transitions. [2025-03-04 09:14:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:14:01,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:01,103 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:01,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:14:01,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1645727870, now seen corresponding path program 1 times [2025-03-04 09:14:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843724482] [2025-03-04 09:14:01,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:01,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:14:01,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:14:01,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:01,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:01,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:01,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843724482] [2025-03-04 09:14:01,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843724482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:01,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:01,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:14:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609232623] [2025-03-04 09:14:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:01,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:14:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:01,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:14:01,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:14:01,920 INFO L87 Difference]: Start difference. First operand 303 states and 337 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:03,476 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2025-03-04 09:14:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:14:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 09:14:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:03,478 INFO L225 Difference]: With dead ends: 302 [2025-03-04 09:14:03,478 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 09:14:03,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:14:03,479 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 180 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:03,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 857 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:14:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 09:14:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-03-04 09:14:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 200 states have (on average 1.6) internal successors, (320), 292 states have internal predecessors, (320), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 335 transitions. [2025-03-04 09:14:03,485 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 335 transitions. Word has length 53 [2025-03-04 09:14:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:03,485 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 335 transitions. [2025-03-04 09:14:03,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 335 transitions. [2025-03-04 09:14:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:14:03,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:03,485 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:14:03,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:03,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 136877493, now seen corresponding path program 1 times [2025-03-04 09:14:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297481402] [2025-03-04 09:14:03,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:03,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:14:03,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:14:03,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:03,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297481402] [2025-03-04 09:14:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297481402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:03,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116955509] [2025-03-04 09:14:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:03,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:03,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:03,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:03,679 INFO L87 Difference]: Start difference. First operand 302 states and 335 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:03,690 INFO L93 Difference]: Finished difference Result 314 states and 350 transitions. [2025-03-04 09:14:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-04 09:14:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:03,693 INFO L225 Difference]: With dead ends: 314 [2025-03-04 09:14:03,693 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 09:14:03,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:03,694 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 6 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:03,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 541 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 09:14:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 304. [2025-03-04 09:14:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 294 states have internal predecessors, (322), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 337 transitions. [2025-03-04 09:14:03,700 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 337 transitions. Word has length 57 [2025-03-04 09:14:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:03,700 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 337 transitions. [2025-03-04 09:14:03,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 337 transitions. [2025-03-04 09:14:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:14:03,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:03,700 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:03,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:14:03,701 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:03,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash -51518238, now seen corresponding path program 1 times [2025-03-04 09:14:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592796382] [2025-03-04 09:14:03,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:03,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:14:03,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:14:03,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:03,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592796382] [2025-03-04 09:14:04,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592796382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:04,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 09:14:04,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533253262] [2025-03-04 09:14:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:14:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:04,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:14:04,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:14:04,669 INFO L87 Difference]: Start difference. First operand 304 states and 337 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:06,660 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2025-03-04 09:14:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:14:06,660 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 09:14:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:06,661 INFO L225 Difference]: With dead ends: 321 [2025-03-04 09:14:06,661 INFO L226 Difference]: Without dead ends: 321 [2025-03-04 09:14:06,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:14:06,662 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 394 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:06,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 739 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:14:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-04 09:14:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 310. [2025-03-04 09:14:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 208 states have (on average 1.5913461538461537) internal successors, (331), 300 states have internal predecessors, (331), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 346 transitions. [2025-03-04 09:14:06,667 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 346 transitions. Word has length 58 [2025-03-04 09:14:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 346 transitions. [2025-03-04 09:14:06,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 346 transitions. [2025-03-04 09:14:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:14:06,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:06,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:06,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:14:06,668 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:06,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -51518239, now seen corresponding path program 1 times [2025-03-04 09:14:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185838502] [2025-03-04 09:14:06,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:14:06,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:14:06,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:06,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:07,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185838502] [2025-03-04 09:14:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185838502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:07,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:14:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881698024] [2025-03-04 09:14:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:07,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:14:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:07,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:14:07,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:14:07,323 INFO L87 Difference]: Start difference. First operand 310 states and 346 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:10,291 INFO L93 Difference]: Finished difference Result 320 states and 356 transitions. [2025-03-04 09:14:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:14:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 09:14:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:10,292 INFO L225 Difference]: With dead ends: 320 [2025-03-04 09:14:10,292 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 09:14:10,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:14:10,293 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 381 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:10,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1196 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 09:14:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 09:14:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 310. [2025-03-04 09:14:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 300 states have internal predecessors, (329), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 344 transitions. [2025-03-04 09:14:10,302 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 344 transitions. Word has length 58 [2025-03-04 09:14:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:10,302 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 344 transitions. [2025-03-04 09:14:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 344 transitions. [2025-03-04 09:14:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 09:14:10,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:10,303 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:10,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:14:10,303 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:10,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1485865918, now seen corresponding path program 1 times [2025-03-04 09:14:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258257433] [2025-03-04 09:14:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:10,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:14:10,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:14:10,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:10,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:10,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258257433] [2025-03-04 09:14:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258257433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505270841] [2025-03-04 09:14:10,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:10,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:10,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:10,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:10,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:14:10,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:14:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:14:11,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:11,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:11,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:14:11,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:11,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505270841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:11,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:11,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:14:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541967840] [2025-03-04 09:14:11,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:14:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:11,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:14:11,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:14:11,150 INFO L87 Difference]: Start difference. First operand 310 states and 344 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:11,181 INFO L93 Difference]: Finished difference Result 339 states and 378 transitions. [2025-03-04 09:14:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:14:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-04 09:14:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:11,182 INFO L225 Difference]: With dead ends: 339 [2025-03-04 09:14:11,182 INFO L226 Difference]: Without dead ends: 339 [2025-03-04 09:14:11,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:14:11,183 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 17 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:11,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1348 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:14:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-04 09:14:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 334. [2025-03-04 09:14:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.5646551724137931) internal successors, (363), 324 states have internal predecessors, (363), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 378 transitions. [2025-03-04 09:14:11,190 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 378 transitions. Word has length 62 [2025-03-04 09:14:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 378 transitions. [2025-03-04 09:14:11,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 378 transitions. [2025-03-04 09:14:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:14:11,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:11,190 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:11,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:11,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:11,391 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1182550023, now seen corresponding path program 1 times [2025-03-04 09:14:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723659961] [2025-03-04 09:14:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:11,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:14:11,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:14:11,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:11,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723659961] [2025-03-04 09:14:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723659961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441889609] [2025-03-04 09:14:12,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:12,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:12,545 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:12,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:14:12,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:14:13,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:14:13,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:13,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:13,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:14:13,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:13,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 10 treesize of output 8 [2025-03-04 09:14:13,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:14:13,072 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-03-04 09:14:13,083 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-03-04 09:14:13,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 09:14:13,127 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 23 treesize of output 1 [2025-03-04 09:14:13,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-04 09:14:13,193 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-03-04 09:14:13,262 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:14:13,263 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-03-04 09:14:13,272 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-03-04 09:14:13,373 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:14:13,374 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-03-04 09:14:13,385 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 49 treesize of output 26 [2025-03-04 09:14:13,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-04 09:14:13,477 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 36 treesize of output 12 [2025-03-04 09:14:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:13,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:14,055 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 ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_4485 (Array Int Int)) (v_ArrVal_4486 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4485))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< .cse0 0) (forall ((v_ArrVal_4488 (Array Int Int))) (< .cse0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_4488) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))))))) (forall ((v_ArrVal_4485 (Array Int Int)) (v_ArrVal_4486 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4485))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 0) (forall ((v_ArrVal_4487 (Array Int Int)) (v_ArrVal_4488 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4486))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_4488) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4487) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-03-04 09:14:14,110 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_4483 (Array Int Int)) (v_ArrVal_4484 (Array Int Int)) (v_ArrVal_4485 (Array Int Int)) (v_ArrVal_4486 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4484))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4483) .cse5 v_ArrVal_4485))) (or (forall ((v_ArrVal_4487 (Array Int Int)) (v_ArrVal_4488 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_4486))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ 1 (select (select (store .cse0 .cse1 v_ArrVal_4488) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4487) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 0)))))) (forall ((v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4484 (Array Int Int)) (v_ArrVal_4485 (Array Int Int)) (v_ArrVal_4486 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4484))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4483) .cse9 v_ArrVal_4485))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_4488 (Array Int Int))) (< .cse6 (+ 2 (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_4488) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (< .cse6 0))))))))) is different from false [2025-03-04 09:14:14,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:14:14,184 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 471 treesize of output 424 [2025-03-04 09:14:14,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:14:14,197 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 411 treesize of output 268 [2025-03-04 09:14:14,208 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 9808 treesize of output 7952 [2025-03-04 09:14:14,253 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 13133 treesize of output 12477 [2025-03-04 09:14:14,305 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 607 treesize of output 511 [2025-03-04 09:14:14,316 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 511 treesize of output 475 [2025-03-04 09:14:14,327 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 475 treesize of output 451 [2025-03-04 09:14:14,334 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 451 treesize of output 403 [2025-03-04 09:14:14,342 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 403 treesize of output 391 [2025-03-04 09:14:14,350 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 391 treesize of output 379 [2025-03-04 09:14:14,358 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 379 treesize of output 355 [2025-03-04 09:14:14,366 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 355 treesize of output 337 [2025-03-04 09:14:14,376 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 337 treesize of output 325 [2025-03-04 09:14:14,388 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 325 treesize of output 313 [2025-03-04 09:14:14,404 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 313 treesize of output 307 [2025-03-04 09:14:14,627 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 09:14:14,627 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-03-04 09:14:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441889609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:14,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2025-03-04 09:14:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604503158] [2025-03-04 09:14:14,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 09:14:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:14,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 09:14:14,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=797, Unknown=13, NotChecked=118, Total=1056 [2025-03-04 09:14:14,638 INFO L87 Difference]: Start difference. First operand 334 states and 378 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:16,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:25,379 INFO L93 Difference]: Finished difference Result 346 states and 386 transitions. [2025-03-04 09:14:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:14:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 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 63 [2025-03-04 09:14:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:25,380 INFO L225 Difference]: With dead ends: 346 [2025-03-04 09:14:25,380 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 09:14:25,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=268, Invalid=1367, Unknown=13, NotChecked=158, Total=1806 [2025-03-04 09:14:25,382 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 241 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 13 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:25,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2284 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2299 Invalid, 26 Unknown, 507 Unchecked, 10.2s Time] [2025-03-04 09:14:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 09:14:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 334. [2025-03-04 09:14:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.5474137931034482) internal successors, (359), 324 states have internal predecessors, (359), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 09:14:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 374 transitions. [2025-03-04 09:14:25,387 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 374 transitions. Word has length 63 [2025-03-04 09:14:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:25,387 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 374 transitions. [2025-03-04 09:14:25,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:14:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 374 transitions. [2025-03-04 09:14:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:14:25,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:25,388 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:25,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:14:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 09:14:25,591 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-04 09:14:25,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1182550024, now seen corresponding path program 1 times [2025-03-04 09:14:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567017320] [2025-03-04 09:14:25,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:25,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:14:25,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:14:25,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:25,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:14:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567017320] [2025-03-04 09:14:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567017320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053990252] [2025-03-04 09:14:26,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:26,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:26,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:26,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:14:26,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:14:27,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:14:27,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:27,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:27,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 09:14:27,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:27,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 09:14:27,175 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:14:27,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:14:27,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 09:14:27,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-04 09:14:27,311 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:14:27,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 09:14:27,370 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:14:27,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 09:14:27,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-04 09:14:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 09:14:27,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:27,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4919 (Array Int Int)) (v_ArrVal_4920 (Array Int Int))) (= (select |c_#valid| (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_4919))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4920)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:14:35,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:14:35,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-04 09:14:35,656 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 7468 treesize of output 6036 [2025-03-04 09:14:35,719 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 1410 treesize of output 1242 [2025-03-04 09:14:35,729 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 1242 treesize of output 1026 [2025-03-04 09:14:35,738 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 1026 treesize of output 948