./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:50:27,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:50:28,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:50:28,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:50:28,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:50:28,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:50:28,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:50:28,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:50:28,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:50:28,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:50:28,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:50:28,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:50:28,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:50:28,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:50:28,061 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:50:28,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:50:28,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:50:28,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:50:28,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:50:28,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:50:28,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:50:28,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:50:28,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:50:28,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:50:28,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:50:28,065 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 -> 2f1aaf5276e100f83cf10565e66c3b5d8c0baa3bbd1a1424b76fbee71241f226 [2025-02-08 04:50:28,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:50:28,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:50:28,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:50:28,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:50:28,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:50:28,369 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_FNV_test3-1.i [2025-02-08 04:50:29,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438fb2eb4/a77c675962d94dd98fd9aba7e4bbe7f2/FLAG154bc80f3 [2025-02-08 04:50:30,065 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:50:30,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test3-1.i [2025-02-08 04:50:30,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438fb2eb4/a77c675962d94dd98fd9aba7e4bbe7f2/FLAG154bc80f3 [2025-02-08 04:50:30,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438fb2eb4/a77c675962d94dd98fd9aba7e4bbe7f2 [2025-02-08 04:50:30,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:50:30,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:50:30,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:50:30,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:50:30,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:50:30,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:30,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35289ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30, skipping insertion in model container [2025-02-08 04:50:30,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:30,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:50:30,622 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_FNV_test3-1.i[33021,33034] [2025-02-08 04:50:30,728 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_FNV_test3-1.i[44590,44603] [2025-02-08 04:50:30,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:50:30,754 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:50:30,796 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_FNV_test3-1.i[33021,33034] [2025-02-08 04:50:30,872 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_FNV_test3-1.i[44590,44603] [2025-02-08 04:50:30,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:50:30,920 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:50:30,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30 WrapperNode [2025-02-08 04:50:30,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:50:30,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:50:30,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:50:30,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:50:30,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:30,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,049 INFO L138 Inliner]: procedures = 177, calls = 277, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1410 [2025-02-08 04:50:31,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:50:31,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:50:31,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:50:31,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:50:31,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,162 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 34, 219]. 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, 4, 50]. [2025-02-08 04:50:31,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:50:31,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:50:31,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:50:31,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:50:31,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (1/1) ... [2025-02-08 04:50:31,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:50:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:31,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 04:50:31,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 04:50:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:50:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:50:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:50:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:50:31,312 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:50:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:50:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:50:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:50:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:50:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:50:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:50:31,313 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:50:31,313 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:50:31,313 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:50:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:50:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:50:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:50:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:50:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:50:31,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:50:31,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:50:31,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:50:31,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:50:31,517 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:50:31,519 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:50:32,819 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: 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-08 04:50:32,920 INFO L? ?]: Removed 321 outVars from TransFormulas that were not future-live. [2025-02-08 04:50:32,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:50:32,991 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:50:32,995 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:50:32,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:50:32 BoogieIcfgContainer [2025-02-08 04:50:32,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:50:32,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:50:32,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:50:33,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:50:33,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:50:30" (1/3) ... [2025-02-08 04:50:33,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e175bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:50:33, skipping insertion in model container [2025-02-08 04:50:33,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:50:30" (2/3) ... [2025-02-08 04:50:33,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e175bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:50:33, skipping insertion in model container [2025-02-08 04:50:33,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:50:32" (3/3) ... [2025-02-08 04:50:33,006 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test3-1.i [2025-02-08 04:50:33,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:50:33,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test3-1.i that has 5 procedures, 413 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-02-08 04:50:33,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:50:33,097 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;@655390c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:50:33,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 04:50:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 391 states have (on average 1.6240409207161126) internal successors, (635), 398 states have internal predecessors, (635), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 04:50:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 04:50:33,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:33,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:33,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:33,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1205246299, now seen corresponding path program 1 times [2025-02-08 04:50:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641251006] [2025-02-08 04:50:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:33,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 04:50:33,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 04:50:33,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:50:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641251006] [2025-02-08 04:50:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641251006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:33,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:50:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121517608] [2025-02-08 04:50:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:33,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:50:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:33,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:50:33,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:50:33,279 INFO L87 Difference]: Start difference. First operand has 405 states, 391 states have (on average 1.6240409207161126) internal successors, (635), 398 states have internal predecessors, (635), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:50:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:33,416 INFO L93 Difference]: Finished difference Result 809 states and 1306 transitions. [2025-02-08 04:50:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:50:33,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 04:50:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:33,430 INFO L225 Difference]: With dead ends: 809 [2025-02-08 04:50:33,430 INFO L226 Difference]: Without dead ends: 399 [2025-02-08 04:50:33,435 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-08 04:50:33,437 INFO L435 NwaCegarLoop]: 545 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, 545 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-08 04:50:33,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:50:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-08 04:50:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-02-08 04:50:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 388 states have (on average 1.458762886597938) internal successors, (566), 393 states have internal predecessors, (566), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 577 transitions. [2025-02-08 04:50:33,484 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 577 transitions. Word has length 8 [2025-02-08 04:50:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:33,484 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 577 transitions. [2025-02-08 04:50:33,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:50:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 577 transitions. [2025-02-08 04:50:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 04:50:33,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:33,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:50:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:50:33,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1396228208, now seen corresponding path program 1 times [2025-02-08 04:50:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057311036] [2025-02-08 04:50:33,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:33,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 04:50:33,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 04:50:33,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:50:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057311036] [2025-02-08 04:50:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057311036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:33,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:33,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:50:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335348397] [2025-02-08 04:50:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:33,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:50:33,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:33,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:50:33,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:50:33,693 INFO L87 Difference]: Start difference. First operand 399 states and 577 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:50:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:33,980 INFO L93 Difference]: Finished difference Result 989 states and 1436 transitions. [2025-02-08 04:50:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:50:33,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2025-02-08 04:50:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:33,985 INFO L225 Difference]: With dead ends: 989 [2025-02-08 04:50:33,985 INFO L226 Difference]: Without dead ends: 788 [2025-02-08 04:50:33,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:50:33,987 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 554 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:33,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1615 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:50:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-02-08 04:50:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 401. [2025-02-08 04:50:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 390 states have (on average 1.4564102564102563) internal successors, (568), 395 states have internal predecessors, (568), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 579 transitions. [2025-02-08 04:50:34,024 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 579 transitions. Word has length 13 [2025-02-08 04:50:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 579 transitions. [2025-02-08 04:50:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:50:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 579 transitions. [2025-02-08 04:50:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 04:50:34,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:34,028 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:50:34,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:50:34,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:34,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1855993841, now seen corresponding path program 1 times [2025-02-08 04:50:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405786377] [2025-02-08 04:50:34,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:34,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 04:50:34,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 04:50:34,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:34,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:50:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405786377] [2025-02-08 04:50:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405786377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:50:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857660270] [2025-02-08 04:50:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:34,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:50:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:34,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:50:34,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:50:34,549 INFO L87 Difference]: Start difference. First operand 401 states and 579 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-08 04:50:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:34,728 INFO L93 Difference]: Finished difference Result 757 states and 1089 transitions. [2025-02-08 04:50:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:50:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 88 [2025-02-08 04:50:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:34,731 INFO L225 Difference]: With dead ends: 757 [2025-02-08 04:50:34,731 INFO L226 Difference]: Without dead ends: 359 [2025-02-08 04:50:34,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:50:34,732 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 30 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1310 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-08 04:50:34,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1310 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:50:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-08 04:50:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-02-08 04:50:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 348 states have (on average 1.410919540229885) internal successors, (491), 353 states have internal predecessors, (491), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 502 transitions. [2025-02-08 04:50:34,743 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 502 transitions. Word has length 88 [2025-02-08 04:50:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:34,743 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 502 transitions. [2025-02-08 04:50:34,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-08 04:50:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 502 transitions. [2025-02-08 04:50:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 04:50:34,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:34,746 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:50:34,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:50:34,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:34,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash 563112184, now seen corresponding path program 1 times [2025-02-08 04:50:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047940670] [2025-02-08 04:50:34,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:34,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 04:50:34,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 04:50:34,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:34,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:50:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:34,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047940670] [2025-02-08 04:50:34,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047940670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:34,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:34,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:50:34,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622823145] [2025-02-08 04:50:34,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:34,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:50:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:34,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:50:34,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:50:34,968 INFO L87 Difference]: Start difference. First operand 359 states and 502 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-08 04:50:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:35,153 INFO L93 Difference]: Finished difference Result 964 states and 1360 transitions. [2025-02-08 04:50:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:50:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 88 [2025-02-08 04:50:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:35,157 INFO L225 Difference]: With dead ends: 964 [2025-02-08 04:50:35,157 INFO L226 Difference]: Without dead ends: 608 [2025-02-08 04:50:35,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:50:35,158 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 294 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:35,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1065 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:50:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-08 04:50:35,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2025-02-08 04:50:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 593 states have (on average 1.4249578414839799) internal successors, (845), 598 states have internal predecessors, (845), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 856 transitions. [2025-02-08 04:50:35,198 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 856 transitions. Word has length 88 [2025-02-08 04:50:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:35,200 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 856 transitions. [2025-02-08 04:50:35,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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-08 04:50:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 856 transitions. [2025-02-08 04:50:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 04:50:35,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:35,206 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] [2025-02-08 04:50:35,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:50:35,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:35,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash -198754016, now seen corresponding path program 1 times [2025-02-08 04:50:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111215965] [2025-02-08 04:50:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:35,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 04:50:35,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 04:50:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:35,749 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-08 04:50:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111215965] [2025-02-08 04:50:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111215965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:35,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:35,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:50:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036611685] [2025-02-08 04:50:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:35,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:50:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:35,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:50:35,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:50:35,752 INFO L87 Difference]: Start difference. First operand 604 states and 856 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-08 04:50:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:35,976 INFO L93 Difference]: Finished difference Result 896 states and 1269 transitions. [2025-02-08 04:50:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:50:35,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 103 [2025-02-08 04:50:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:35,983 INFO L225 Difference]: With dead ends: 896 [2025-02-08 04:50:35,984 INFO L226 Difference]: Without dead ends: 880 [2025-02-08 04:50:35,984 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-08 04:50:35,985 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 455 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:35,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1320 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:50:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-08 04:50:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 606. [2025-02-08 04:50:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 595 states have (on average 1.423529411764706) internal successors, (847), 600 states have internal predecessors, (847), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 858 transitions. [2025-02-08 04:50:36,009 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 858 transitions. Word has length 103 [2025-02-08 04:50:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:36,009 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 858 transitions. [2025-02-08 04:50:36,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-08 04:50:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 858 transitions. [2025-02-08 04:50:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:50:36,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:36,012 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] [2025-02-08 04:50:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:50:36,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:36,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 355074785, now seen corresponding path program 1 times [2025-02-08 04:50:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850920387] [2025-02-08 04:50:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:36,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:50:36,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:50:36,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:36,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:36,313 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-08 04:50:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850920387] [2025-02-08 04:50:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850920387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:36,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:50:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592763253] [2025-02-08 04:50:36,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:50:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:36,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:50:36,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:50:36,316 INFO L87 Difference]: Start difference. First operand 606 states and 858 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:36,448 INFO L93 Difference]: Finished difference Result 1005 states and 1445 transitions. [2025-02-08 04:50:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:50:36,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-02-08 04:50:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:36,452 INFO L225 Difference]: With dead ends: 1005 [2025-02-08 04:50:36,452 INFO L226 Difference]: Without dead ends: 646 [2025-02-08 04:50:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:50:36,454 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 8 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:36,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 867 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:50:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-08 04:50:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-02-08 04:50:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 635 states have (on average 1.3968503937007875) internal successors, (887), 640 states have internal predecessors, (887), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 898 transitions. [2025-02-08 04:50:36,471 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 898 transitions. Word has length 152 [2025-02-08 04:50:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:36,472 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 898 transitions. [2025-02-08 04:50:36,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 898 transitions. [2025-02-08 04:50:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:50:36,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:36,475 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] [2025-02-08 04:50:36,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:50:36,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:36,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1929788670, now seen corresponding path program 1 times [2025-02-08 04:50:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137147681] [2025-02-08 04:50:36,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:36,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:50:36,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:50:36,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:36,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:36,788 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-08 04:50:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137147681] [2025-02-08 04:50:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137147681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:50:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55406830] [2025-02-08 04:50:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:36,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:50:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:36,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:50:36,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:50:36,791 INFO L87 Difference]: Start difference. First operand 646 states and 898 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:36,914 INFO L93 Difference]: Finished difference Result 921 states and 1287 transitions. [2025-02-08 04:50:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:50:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-02-08 04:50:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:36,917 INFO L225 Difference]: With dead ends: 921 [2025-02-08 04:50:36,917 INFO L226 Difference]: Without dead ends: 522 [2025-02-08 04:50:36,918 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-08 04:50:36,920 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 32 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:36,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1084 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:50:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-08 04:50:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-02-08 04:50:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 511 states have (on average 1.3444227005870841) internal successors, (687), 516 states have internal predecessors, (687), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 698 transitions. [2025-02-08 04:50:36,937 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 698 transitions. Word has length 152 [2025-02-08 04:50:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 698 transitions. [2025-02-08 04:50:36,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 698 transitions. [2025-02-08 04:50:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-08 04:50:36,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:36,940 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] [2025-02-08 04:50:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:50:36,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:36,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1053965733, now seen corresponding path program 1 times [2025-02-08 04:50:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703274497] [2025-02-08 04:50:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 04:50:37,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 04:50:37,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:37,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:37,219 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-08 04:50:37,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703274497] [2025-02-08 04:50:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703274497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:50:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956401826] [2025-02-08 04:50:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:37,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:50:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:37,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:50:37,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:50:37,223 INFO L87 Difference]: Start difference. First operand 522 states and 698 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:38,574 INFO L93 Difference]: Finished difference Result 1307 states and 1748 transitions. [2025-02-08 04:50:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:50:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2025-02-08 04:50:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:38,581 INFO L225 Difference]: With dead ends: 1307 [2025-02-08 04:50:38,581 INFO L226 Difference]: Without dead ends: 874 [2025-02-08 04:50:38,582 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-08 04:50:38,582 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1334 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:38,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1099 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 04:50:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-08 04:50:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 660. [2025-02-08 04:50:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 649 states have (on average 1.3436055469953776) internal successors, (872), 654 states have internal predecessors, (872), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 04:50:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 883 transitions. [2025-02-08 04:50:38,608 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 883 transitions. Word has length 152 [2025-02-08 04:50:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:38,609 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 883 transitions. [2025-02-08 04:50:38,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 883 transitions. [2025-02-08 04:50:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 04:50:38,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:38,613 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] [2025-02-08 04:50:38,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:50:38,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:38,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1324505907, now seen corresponding path program 1 times [2025-02-08 04:50:38,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:38,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202199734] [2025-02-08 04:50:38,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:38,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:50:38,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:50:38,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:38,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202199734] [2025-02-08 04:50:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202199734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:39,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720021405] [2025-02-08 04:50:39,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:39,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:39,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:50:39,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 04:50:39,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 04:50:39,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:39,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:39,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 04:50:39,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:39,894 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-08 04:50:40,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 04:50:40,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:50:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:40,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:50:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:40,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720021405] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:50:40,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:50:40,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-02-08 04:50:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136227375] [2025-02-08 04:50:40,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:50:40,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:50:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:40,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:50:40,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-08 04:50:40,395 INFO L87 Difference]: Start difference. First operand 660 states and 883 transitions. Second operand has 11 states, 11 states have (on average 29.181818181818183) internal successors, (321), 11 states have internal predecessors, (321), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:50:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:40,893 INFO L93 Difference]: Finished difference Result 2132 states and 2856 transitions. [2025-02-08 04:50:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:50:40,894 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.181818181818183) internal successors, (321), 11 states have internal predecessors, (321), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2025-02-08 04:50:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:40,901 INFO L225 Difference]: With dead ends: 2132 [2025-02-08 04:50:40,901 INFO L226 Difference]: Without dead ends: 1716 [2025-02-08 04:50:40,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-08 04:50:40,903 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 2082 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:40,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 3212 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:50:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2025-02-08 04:50:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1002. [2025-02-08 04:50:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 987 states have (on average 1.3414387031408308) internal successors, (1324), 992 states have internal predecessors, (1324), 11 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:50:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1341 transitions. [2025-02-08 04:50:40,950 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1341 transitions. Word has length 162 [2025-02-08 04:50:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1341 transitions. [2025-02-08 04:50:40,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.181818181818183) internal successors, (321), 11 states have internal predecessors, (321), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:50:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1341 transitions. [2025-02-08 04:50:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-08 04:50:40,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:40,958 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-08 04:50:40,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:50:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:41,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:41,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash -371185243, now seen corresponding path program 1 times [2025-02-08 04:50:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289146463] [2025-02-08 04:50:41,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:50:41,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:50:41,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:41,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:44,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:44,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289146463] [2025-02-08 04:50:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289146463] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305381109] [2025-02-08 04:50:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:44,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:44,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:44,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:44,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:50:45,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-08 04:50:45,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-08 04:50:45,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:45,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:45,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 04:50:45,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:45,350 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-08 04:50:45,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 04:50:45,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 04:50:45,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 04:50:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:45,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:50:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:50:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305381109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:50:46,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:50:46,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-02-08 04:50:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530614115] [2025-02-08 04:50:46,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:50:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 04:50:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:46,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 04:50:46,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-08 04:50:46,497 INFO L87 Difference]: Start difference. First operand 1002 states and 1341 transitions. Second operand has 20 states, 20 states have (on average 38.85) internal successors, (777), 20 states have internal predecessors, (777), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:50:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:47,454 INFO L93 Difference]: Finished difference Result 4211 states and 5655 transitions. [2025-02-08 04:50:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 04:50:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.85) internal successors, (777), 20 states have internal predecessors, (777), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 387 [2025-02-08 04:50:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:47,471 INFO L225 Difference]: With dead ends: 4211 [2025-02-08 04:50:47,472 INFO L226 Difference]: Without dead ends: 3795 [2025-02-08 04:50:47,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 766 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-02-08 04:50:47,475 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 5616 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5626 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:47,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5626 Valid, 5167 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 04:50:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2025-02-08 04:50:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 1854. [2025-02-08 04:50:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1833 states have (on average 1.3409710856519368) internal successors, (2458), 1838 states have internal predecessors, (2458), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:50:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2487 transitions. [2025-02-08 04:50:47,558 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2487 transitions. Word has length 387 [2025-02-08 04:50:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:47,560 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2487 transitions. [2025-02-08 04:50:47,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.85) internal successors, (777), 20 states have internal predecessors, (777), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 04:50:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2487 transitions. [2025-02-08 04:50:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-08 04:50:47,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:47,579 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 04:50:47,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 04:50:47,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:47,783 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:47,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1526550181, now seen corresponding path program 2 times [2025-02-08 04:50:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:47,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577799333] [2025-02-08 04:50:47,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:50:47,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:48,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 837 statements into 2 equivalence classes. [2025-02-08 04:50:48,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 837 statements. [2025-02-08 04:50:48,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:50:48,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 04:50:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577799333] [2025-02-08 04:50:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577799333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:48,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:48,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:50:48,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211900807] [2025-02-08 04:50:48,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:48,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:50:48,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:48,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:50:48,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:50:48,267 INFO L87 Difference]: Start difference. First operand 1854 states and 2487 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:48,658 INFO L93 Difference]: Finished difference Result 2282 states and 3064 transitions. [2025-02-08 04:50:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:50:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 837 [2025-02-08 04:50:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:48,669 INFO L225 Difference]: With dead ends: 2282 [2025-02-08 04:50:48,669 INFO L226 Difference]: Without dead ends: 1869 [2025-02-08 04:50:48,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:50:48,671 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 14 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:48,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1606 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:50:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-02-08 04:50:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1860. [2025-02-08 04:50:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1839 states have (on average 1.3398586188145731) internal successors, (2464), 1844 states have internal predecessors, (2464), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:50:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2493 transitions. [2025-02-08 04:50:48,727 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2493 transitions. Word has length 837 [2025-02-08 04:50:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:48,729 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2493 transitions. [2025-02-08 04:50:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2493 transitions. [2025-02-08 04:50:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-08 04:50:48,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:48,779 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 04:50:48,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:50:48,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:48,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash 940296034, now seen corresponding path program 1 times [2025-02-08 04:50:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988158119] [2025-02-08 04:50:48,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:49,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-08 04:50:49,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-08 04:50:49,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:49,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 04:50:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988158119] [2025-02-08 04:50:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988158119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:51,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:51,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:50:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725133771] [2025-02-08 04:50:51,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:51,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:50:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:51,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:50:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:50:51,276 INFO L87 Difference]: Start difference. First operand 1860 states and 2493 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:51,650 INFO L93 Difference]: Finished difference Result 2294 states and 3076 transitions. [2025-02-08 04:50:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:50:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 838 [2025-02-08 04:50:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:51,662 INFO L225 Difference]: With dead ends: 2294 [2025-02-08 04:50:51,662 INFO L226 Difference]: Without dead ends: 1875 [2025-02-08 04:50:51,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:50:51,664 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 15 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:51,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1928 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:50:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-02-08 04:50:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1872. [2025-02-08 04:50:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1851 states have (on average 1.3392760669908157) internal successors, (2479), 1856 states have internal predecessors, (2479), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:50:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2508 transitions. [2025-02-08 04:50:51,747 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2508 transitions. Word has length 838 [2025-02-08 04:50:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:51,749 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2508 transitions. [2025-02-08 04:50:51,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2508 transitions. [2025-02-08 04:50:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-08 04:50:51,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:51,757 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 04:50:51,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 04:50:51,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:51,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2039092507, now seen corresponding path program 1 times [2025-02-08 04:50:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518459346] [2025-02-08 04:50:51,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:52,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes.