./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:50:52,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:50:52,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:50:52,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:50:52,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:50:52,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:50:52,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:50:52,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:50:52,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:50:52,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:50:52,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:50:52,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:50:52,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:50:52,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:50:52,989 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:50:52,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:50:52,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:50:52,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:50:52,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:50:52,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:50:52,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:50:52,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:50:52,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:50:52,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:50:52,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:50:52,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:50:52,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:50:52,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:50:52,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:50:52,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:50:52,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:50:52,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:50:52,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:50:52,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:50:52,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:50:52,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:50:52,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:50:52,993 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-02-06 08:50:53,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:50:53,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:50:53,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:50:53,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:50:53,258 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:50:53,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-02-06 08:50:54,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b380a8c/247127f133b944068402c73c131e8e73/FLAG2bf7d225e [2025-02-06 08:50:54,890 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:50:54,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-02-06 08:50:54,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b380a8c/247127f133b944068402c73c131e8e73/FLAG2bf7d225e [2025-02-06 08:50:55,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31b380a8c/247127f133b944068402c73c131e8e73 [2025-02-06 08:50:55,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:50:55,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:50:55,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:50:55,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:50:55,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:50:55,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:55,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd3c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55, skipping insertion in model container [2025-02-06 08:50:55,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:55,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:50:55,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i[33519,33532] [2025-02-06 08:50:55,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:50:55,709 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:50:55,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i[33519,33532] [2025-02-06 08:50:55,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:50:55,854 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:50:55,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55 WrapperNode [2025-02-06 08:50:55,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:50:55,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:50:55,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:50:55,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:50:55,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:55,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:55,967 INFO L138 Inliner]: procedures = 177, calls = 273, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1386 [2025-02-06 08:50:55,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:50:55,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:50:55,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:50:55,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:50:55,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:55,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,088 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-06 08:50:56,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:50:56,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:50:56,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:50:56,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:50:56,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (1/1) ... [2025-02-06 08:50:56,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:50:56,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:50:56,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:50:56,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:50:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:50:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:50:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:50:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:50:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:50:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:50:56,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:50:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:50:56,459 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:50:56,461 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:50:57,986 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:50:58,088 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2025-02-06 08:50:58,089 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:50:58,142 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:50:58,142 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:50:58,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:50:58 BoogieIcfgContainer [2025-02-06 08:50:58,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:50:58,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:50:58,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:50:58,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:50:58,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:50:55" (1/3) ... [2025-02-06 08:50:58,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fb75c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:50:58, skipping insertion in model container [2025-02-06 08:50:58,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:50:55" (2/3) ... [2025-02-06 08:50:58,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fb75c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:50:58, skipping insertion in model container [2025-02-06 08:50:58,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:50:58" (3/3) ... [2025-02-06 08:50:58,153 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test3-1.i [2025-02-06 08:50:58,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:50:58,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test3-1.i that has 5 procedures, 405 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-02-06 08:50:58,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:50:58,255 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=LoopHeads, 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;@4dce7026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:50:58,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:50:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 388 states have (on average 1.615979381443299) internal successors, (627), 390 states have internal predecessors, (627), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 08:50:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 08:50:58,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:50:58,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:50:58,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:50:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:50:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1586703850, now seen corresponding path program 1 times [2025-02-06 08:50:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:50:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893078337] [2025-02-06 08:50:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:50:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:50:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 08:50:58,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 08:50:58,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:50:58,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:50:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:50:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:50:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893078337] [2025-02-06 08:50:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893078337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:50:58,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:50:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:50:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926745022] [2025-02-06 08:50:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:50:58,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:50:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:50:58,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:50:58,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:50:58,488 INFO L87 Difference]: Start difference. First operand has 397 states, 388 states have (on average 1.615979381443299) internal successors, (627), 390 states have internal predecessors, (627), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:50:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:50:58,640 INFO L93 Difference]: Finished difference Result 791 states and 1272 transitions. [2025-02-06 08:50:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:50:58,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 08:50:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:50:58,656 INFO L225 Difference]: With dead ends: 791 [2025-02-06 08:50:58,657 INFO L226 Difference]: Without dead ends: 394 [2025-02-06 08:50:58,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:50:58,668 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:50:58,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:50:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-06 08:50:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-02-06 08:50:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 386 states have (on average 1.450777202072539) internal successors, (560), 387 states have internal predecessors, (560), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 08:50:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 570 transitions. [2025-02-06 08:50:58,745 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 570 transitions. Word has length 12 [2025-02-06 08:50:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:50:58,746 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 570 transitions. [2025-02-06 08:50:58,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:50:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 570 transitions. [2025-02-06 08:50:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 08:50:58,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:50:58,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:50:58,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:50:58,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:50:58,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:50:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2034056232, now seen corresponding path program 1 times [2025-02-06 08:50:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:50:58,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960039882] [2025-02-06 08:50:58,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:50:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:50:58,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 08:50:58,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 08:50:58,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:50:58,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:50:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:50:59,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:50:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960039882] [2025-02-06 08:50:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960039882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:50:59,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:50:59,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:50:59,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669607064] [2025-02-06 08:50:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:50:59,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:50:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:50:59,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:50:59,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:50:59,030 INFO L87 Difference]: Start difference. First operand 394 states and 570 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:50:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:50:59,647 INFO L93 Difference]: Finished difference Result 1079 states and 1579 transitions. [2025-02-06 08:50:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:50:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 08:50:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:50:59,654 INFO L225 Difference]: With dead ends: 1079 [2025-02-06 08:50:59,654 INFO L226 Difference]: Without dead ends: 686 [2025-02-06 08:50:59,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:50:59,657 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 428 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:50:59,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1504 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:50:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-06 08:50:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 685. [2025-02-06 08:50:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 676 states have (on average 1.470414201183432) internal successors, (994), 678 states have internal predecessors, (994), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:50:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1006 transitions. [2025-02-06 08:50:59,715 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1006 transitions. Word has length 14 [2025-02-06 08:50:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:50:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1006 transitions. [2025-02-06 08:50:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:50:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1006 transitions. [2025-02-06 08:50:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:50:59,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:50:59,721 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:50:59,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:50:59,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:50:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:50:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash -143306638, now seen corresponding path program 1 times [2025-02-06 08:50:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:50:59,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444535560] [2025-02-06 08:50:59,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:50:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:50:59,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:50:59,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:50:59,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:50:59,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:50:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:50:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:50:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444535560] [2025-02-06 08:50:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444535560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:50:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:50:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:50:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458738021] [2025-02-06 08:50:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:50:59,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:50:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:50:59,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:50:59,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:50:59,995 INFO L87 Difference]: Start difference. First operand 685 states and 1006 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:51:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:00,181 INFO L93 Difference]: Finished difference Result 954 states and 1393 transitions. [2025-02-06 08:51:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:51:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:51:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:00,187 INFO L225 Difference]: With dead ends: 954 [2025-02-06 08:51:00,189 INFO L226 Difference]: Without dead ends: 601 [2025-02-06 08:51:00,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:51:00,191 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 30 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:00,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1289 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:51:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-06 08:51:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-02-06 08:51:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 592 states have (on average 1.4189189189189189) internal successors, (840), 594 states have internal predecessors, (840), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:51:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 852 transitions. [2025-02-06 08:51:00,228 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 852 transitions. Word has length 67 [2025-02-06 08:51:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:00,229 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 852 transitions. [2025-02-06 08:51:00,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:51:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 852 transitions. [2025-02-06 08:51:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:51:00,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:00,235 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:51:00,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:51:00,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:00,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -428513671, now seen corresponding path program 1 times [2025-02-06 08:51:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:00,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555745050] [2025-02-06 08:51:00,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:51:00,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:51:00,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:00,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:51:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555745050] [2025-02-06 08:51:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555745050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:51:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:51:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:51:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508629452] [2025-02-06 08:51:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:51:00,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:51:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:51:00,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:51:00,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:51:00,829 INFO L87 Difference]: Start difference. First operand 601 states and 852 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:51:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:01,194 INFO L93 Difference]: Finished difference Result 1110 states and 1543 transitions. [2025-02-06 08:51:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:51:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:51:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:01,202 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 08:51:01,202 INFO L226 Difference]: Without dead ends: 838 [2025-02-06 08:51:01,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:51:01,204 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 461 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:01,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2766 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:51:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-02-06 08:51:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 600. [2025-02-06 08:51:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 591 states have (on average 1.4179357021996617) internal successors, (838), 593 states have internal predecessors, (838), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:51:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 850 transitions. [2025-02-06 08:51:01,242 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 850 transitions. Word has length 67 [2025-02-06 08:51:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:01,243 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 850 transitions. [2025-02-06 08:51:01,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:51:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 850 transitions. [2025-02-06 08:51:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:51:01,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:01,248 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:51:01,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:51:01,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:01,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash -853893263, now seen corresponding path program 1 times [2025-02-06 08:51:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453877103] [2025-02-06 08:51:01,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:01,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:51:01,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:51:01,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:01,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:51:01,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453877103] [2025-02-06 08:51:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453877103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:51:01,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:51:01,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:51:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481726836] [2025-02-06 08:51:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:51:01,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:51:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:51:01,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:51:01,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:51:01,566 INFO L87 Difference]: Start difference. First operand 600 states and 850 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:01,720 INFO L93 Difference]: Finished difference Result 1146 states and 1617 transitions. [2025-02-06 08:51:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:51:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:51:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:01,724 INFO L225 Difference]: With dead ends: 1146 [2025-02-06 08:51:01,724 INFO L226 Difference]: Without dead ends: 606 [2025-02-06 08:51:01,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:51:01,726 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 105 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:01,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1197 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:51:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-02-06 08:51:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 600. [2025-02-06 08:51:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 591 states have (on average 1.3942470389170898) internal successors, (824), 593 states have internal predecessors, (824), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:51:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 836 transitions. [2025-02-06 08:51:01,757 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 836 transitions. Word has length 104 [2025-02-06 08:51:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:01,760 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 836 transitions. [2025-02-06 08:51:01,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 836 transitions. [2025-02-06 08:51:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:51:01,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:01,762 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:51:01,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:51:01,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:01,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash 274790456, now seen corresponding path program 1 times [2025-02-06 08:51:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:01,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815259061] [2025-02-06 08:51:01,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:01,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:51:02,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:51:02,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:02,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:51:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815259061] [2025-02-06 08:51:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815259061] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:51:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701674507] [2025-02-06 08:51:02,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:02,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:02,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:51:02,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:51:02,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:51:02,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:51:02,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:51:02,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:02,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:02,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 08:51:02,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:51:02,649 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:51:02,677 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-06 08:51:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:51:03,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:51:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701674507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:51:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:51:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 08:51:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145349725] [2025-02-06 08:51:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:51:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:51:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:51:03,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:51:03,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:51:03,681 INFO L87 Difference]: Start difference. First operand 600 states and 836 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:06,073 INFO L93 Difference]: Finished difference Result 1400 states and 1937 transitions. [2025-02-06 08:51:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:51:06,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:51:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:06,081 INFO L225 Difference]: With dead ends: 1400 [2025-02-06 08:51:06,081 INFO L226 Difference]: Without dead ends: 886 [2025-02-06 08:51:06,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:51:06,083 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 725 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:06,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 2873 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 08:51:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-06 08:51:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 625. [2025-02-06 08:51:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 616 states have (on average 1.3863636363636365) internal successors, (854), 618 states have internal predecessors, (854), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:51:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 866 transitions. [2025-02-06 08:51:06,114 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 866 transitions. Word has length 104 [2025-02-06 08:51:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:06,114 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 866 transitions. [2025-02-06 08:51:06,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 866 transitions. [2025-02-06 08:51:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 08:51:06,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:06,116 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:51:06,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:51:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:06,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1042517297, now seen corresponding path program 1 times [2025-02-06 08:51:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635447623] [2025-02-06 08:51:06,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:06,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:51:06,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:51:06,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:06,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:51:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:06,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635447623] [2025-02-06 08:51:06,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635447623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:51:06,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138985994] [2025-02-06 08:51:06,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:06,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:51:06,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:51:06,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:51:07,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:51:07,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:51:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:07,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:51:07,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:51:07,354 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:51:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:51:07,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:51:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138985994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:51:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:51:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-06 08:51:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261622863] [2025-02-06 08:51:07,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:51:07,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:51:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:51:07,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:51:07,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:51:07,388 INFO L87 Difference]: Start difference. First operand 625 states and 866 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:07,579 INFO L93 Difference]: Finished difference Result 808 states and 1114 transitions. [2025-02-06 08:51:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:51:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-02-06 08:51:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:07,584 INFO L225 Difference]: With dead ends: 808 [2025-02-06 08:51:07,585 INFO L226 Difference]: Without dead ends: 798 [2025-02-06 08:51:07,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:51:07,586 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 739 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:07,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1276 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:51:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-06 08:51:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 627. [2025-02-06 08:51:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 618 states have (on average 1.3851132686084142) internal successors, (856), 620 states have internal predecessors, (856), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:51:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 868 transitions. [2025-02-06 08:51:07,613 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 868 transitions. Word has length 105 [2025-02-06 08:51:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:07,614 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 868 transitions. [2025-02-06 08:51:07,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 868 transitions. [2025-02-06 08:51:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 08:51:07,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:07,616 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 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, 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, 1, 1, 1] [2025-02-06 08:51:07,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:51:07,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:07,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:07,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 400263730, now seen corresponding path program 1 times [2025-02-06 08:51:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360380450] [2025-02-06 08:51:07,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:07,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 08:51:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 08:51:07,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:07,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:51:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360380450] [2025-02-06 08:51:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360380450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:51:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:51:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:51:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333225834] [2025-02-06 08:51:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:51:08,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:51:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:51:08,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:51:08,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:51:08,108 INFO L87 Difference]: Start difference. First operand 627 states and 868 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:08,752 INFO L93 Difference]: Finished difference Result 1438 states and 1982 transitions. [2025-02-06 08:51:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:51:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 158 [2025-02-06 08:51:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:08,758 INFO L225 Difference]: With dead ends: 1438 [2025-02-06 08:51:08,758 INFO L226 Difference]: Without dead ends: 969 [2025-02-06 08:51:08,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:51:08,760 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1293 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:08,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 1607 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:51:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-02-06 08:51:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 766. [2025-02-06 08:51:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 756 states have (on average 1.380952380952381) internal successors, (1044), 759 states have internal predecessors, (1044), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 08:51:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1058 transitions. [2025-02-06 08:51:08,790 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1058 transitions. Word has length 158 [2025-02-06 08:51:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:08,790 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1058 transitions. [2025-02-06 08:51:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1058 transitions. [2025-02-06 08:51:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 08:51:08,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:08,792 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:51:08,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:51:08,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:08,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1491693792, now seen corresponding path program 1 times [2025-02-06 08:51:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972981982] [2025-02-06 08:51:08,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:08,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:51:09,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:51:09,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:09,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:51:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972981982] [2025-02-06 08:51:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972981982] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:51:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824015121] [2025-02-06 08:51:09,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:51:09,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:51:09,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:51:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:51:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:51:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:09,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 08:51:09,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:51:09,706 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:51:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:51:10,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:51:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824015121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:51:10,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:51:10,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-06 08:51:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436845154] [2025-02-06 08:51:10,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:51:10,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:51:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:51:10,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:51:10,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:51:10,269 INFO L87 Difference]: Start difference. First operand 766 states and 1058 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:51:11,522 INFO L93 Difference]: Finished difference Result 1404 states and 1919 transitions. [2025-02-06 08:51:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:51:11,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-06 08:51:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:51:11,528 INFO L225 Difference]: With dead ends: 1404 [2025-02-06 08:51:11,529 INFO L226 Difference]: Without dead ends: 996 [2025-02-06 08:51:11,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-06 08:51:11,532 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 465 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:51:11,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 3084 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:51:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-02-06 08:51:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 800. [2025-02-06 08:51:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 790 states have (on average 1.369620253164557) internal successors, (1082), 793 states have internal predecessors, (1082), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 08:51:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1096 transitions. [2025-02-06 08:51:11,567 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1096 transitions. Word has length 168 [2025-02-06 08:51:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:51:11,568 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1096 transitions. [2025-02-06 08:51:11,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:51:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1096 transitions. [2025-02-06 08:51:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:51:11,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:51:11,571 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:51:11,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:51:11,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:11,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:51:11,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:51:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -600026213, now seen corresponding path program 1 times [2025-02-06 08:51:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:51:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782332300] [2025-02-06 08:51:11,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:51:11,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:51:11,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:51:11,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:11,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:51:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:51:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782332300] [2025-02-06 08:51:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782332300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:51:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841456967] [2025-02-06 08:51:12,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:51:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:51:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:51:12,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:51:12,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:51:12,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:51:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:51:12,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:51:12,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:51:12,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 08:51:12,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:51:37,219 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 08:51:47,729 WARN L286 SmtUtils]: Spent 10.51s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 08:52:03,866 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 08:52:15,900 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)