./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:35:14,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:35:14,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:35:14,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:35:14,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:35:14,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:35:14,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:35:14,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:35:14,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:35:14,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:35:14,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:35:14,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:35:14,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:35:14,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:35:14,976 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:35:14,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:35:14,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:35:14,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:35:14,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:35:14,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:35:14,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:35:14,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:35:14,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:35:14,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:35:14,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:35:14,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:35:14,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:35:14,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:35:14,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:35:14,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:35:14,980 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-02-06 08:35:15,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:35:15,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:35:15,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:35:15,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:35:15,270 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:35:15,271 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_nondet_test2-1.i [2025-02-06 08:35:16,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e969a55c/5489a4321b6f44a4b950236255203357/FLAG3be885dcc [2025-02-06 08:35:16,958 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:35:16,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-02-06 08:35:16,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e969a55c/5489a4321b6f44a4b950236255203357/FLAG3be885dcc [2025-02-06 08:35:16,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e969a55c/5489a4321b6f44a4b950236255203357 [2025-02-06 08:35:17,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:35:17,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:35:17,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:35:17,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:35:17,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:35:17,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2235f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17, skipping insertion in model container [2025-02-06 08:35:17,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:35:17,401 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_nondet_test2-1.i[37435,37448] [2025-02-06 08:35:17,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:35:17,520 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:35:17,552 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_nondet_test2-1.i[37435,37448] [2025-02-06 08:35:17,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:35:17,663 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:35:17,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17 WrapperNode [2025-02-06 08:35:17,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:35:17,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:35:17,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:35:17,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:35:17,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,745 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1239 [2025-02-06 08:35:17,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:35:17,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:35:17,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:35:17,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:35:17,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,825 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-06 08:35:17,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:35:17,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:35:17,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:35:17,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:35:17,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (1/1) ... [2025-02-06 08:35:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:35:17,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:17,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:35:17,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:35:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:35:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:35:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:35:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:35:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:35:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:35:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:35:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:35:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:35:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:35:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:35:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:35:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:35:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:35:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:35:18,167 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:35:18,170 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:35:19,375 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:35:19,474 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-02-06 08:35:19,474 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:35:19,522 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:35:19,522 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:35:19,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:35:19 BoogieIcfgContainer [2025-02-06 08:35:19,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:35:19,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:35:19,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:35:19,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:35:19,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:35:17" (1/3) ... [2025-02-06 08:35:19,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690c93e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:35:19, skipping insertion in model container [2025-02-06 08:35:19,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:35:17" (2/3) ... [2025-02-06 08:35:19,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690c93e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:35:19, skipping insertion in model container [2025-02-06 08:35:19,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:35:19" (3/3) ... [2025-02-06 08:35:19,530 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2025-02-06 08:35:19,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:35:19,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-1.i that has 4 procedures, 370 locations, 1 initial locations, 33 loop locations, and 1 error locations. [2025-02-06 08:35:19,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:35:19,612 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;@69b88950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:35:19,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:35:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 356 states have (on average 1.6151685393258426) internal successors, (575), 357 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 08:35:19,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:19,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:19,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:19,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1682739452, now seen corresponding path program 1 times [2025-02-06 08:35:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:19,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414530566] [2025-02-06 08:35:19,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:19,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 08:35:19,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 08:35:19,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:19,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:35:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414530566] [2025-02-06 08:35:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414530566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:19,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:35:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337044806] [2025-02-06 08:35:19,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:19,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:35:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:19,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:35:19,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:35:19,803 INFO L87 Difference]: Start difference. First operand has 362 states, 356 states have (on average 1.6151685393258426) internal successors, (575), 357 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:19,951 INFO L93 Difference]: Finished difference Result 721 states and 1158 transitions. [2025-02-06 08:35:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:35:19,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-02-06 08:35:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:19,965 INFO L225 Difference]: With dead ends: 721 [2025-02-06 08:35:19,965 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 08:35:19,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:35:19,973 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:19,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:35:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 08:35:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-06 08:35:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 353 states have (on average 1.4589235127478755) internal successors, (515), 353 states have internal predecessors, (515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 521 transitions. [2025-02-06 08:35:20,040 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 521 transitions. Word has length 11 [2025-02-06 08:35:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:20,041 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 521 transitions. [2025-02-06 08:35:20,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 521 transitions. [2025-02-06 08:35:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 08:35:20,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:20,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:20,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:35:20,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:20,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1612993914, now seen corresponding path program 1 times [2025-02-06 08:35:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:20,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215955505] [2025-02-06 08:35:20,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 08:35:20,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 08:35:20,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:20,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:35:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215955505] [2025-02-06 08:35:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215955505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:20,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:20,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:35:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233661745] [2025-02-06 08:35:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:20,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:35:20,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:20,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:35:20,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:35:20,460 INFO L87 Difference]: Start difference. First operand 358 states and 521 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:20,654 INFO L93 Difference]: Finished difference Result 473 states and 687 transitions. [2025-02-06 08:35:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:35:20,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2025-02-06 08:35:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:20,657 INFO L225 Difference]: With dead ends: 473 [2025-02-06 08:35:20,658 INFO L226 Difference]: Without dead ends: 316 [2025-02-06 08:35:20,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:35:20,660 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 33 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:20,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1145 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:35:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-02-06 08:35:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-02-06 08:35:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.4083601286173633) internal successors, (438), 311 states have internal predecessors, (438), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 444 transitions. [2025-02-06 08:35:20,681 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 444 transitions. Word has length 65 [2025-02-06 08:35:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:20,681 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 444 transitions. [2025-02-06 08:35:20,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 444 transitions. [2025-02-06 08:35:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 08:35:20,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:20,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:20,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:35:20,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1693246668, now seen corresponding path program 1 times [2025-02-06 08:35:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818870239] [2025-02-06 08:35:20,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:20,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:20,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 08:35:20,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 08:35:20,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:20,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:35:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818870239] [2025-02-06 08:35:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818870239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:35:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738804795] [2025-02-06 08:35:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:21,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:21,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:21,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:35:21,283 INFO L87 Difference]: Start difference. First operand 316 states and 444 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:21,573 INFO L93 Difference]: Finished difference Result 742 states and 1038 transitions. [2025-02-06 08:35:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:35:21,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-02-06 08:35:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:21,576 INFO L225 Difference]: With dead ends: 742 [2025-02-06 08:35:21,577 INFO L226 Difference]: Without dead ends: 624 [2025-02-06 08:35:21,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:21,581 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 422 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:21,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1566 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:35:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-06 08:35:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 318. [2025-02-06 08:35:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4057507987220448) internal successors, (440), 313 states have internal predecessors, (440), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 446 transitions. [2025-02-06 08:35:21,610 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 446 transitions. Word has length 65 [2025-02-06 08:35:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:21,611 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 446 transitions. [2025-02-06 08:35:21,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 446 transitions. [2025-02-06 08:35:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 08:35:21,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:21,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:35:21,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash -897745166, now seen corresponding path program 1 times [2025-02-06 08:35:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349083772] [2025-02-06 08:35:21,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:21,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 08:35:21,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 08:35:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:21,940 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-06 08:35:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349083772] [2025-02-06 08:35:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349083772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:35:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889946448] [2025-02-06 08:35:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:35:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:21,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:35:21,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:35:21,942 INFO L87 Difference]: Start difference. First operand 318 states and 446 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:22,080 INFO L93 Difference]: Finished difference Result 589 states and 821 transitions. [2025-02-06 08:35:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:35:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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 140 [2025-02-06 08:35:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:22,082 INFO L225 Difference]: With dead ends: 589 [2025-02-06 08:35:22,084 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 08:35:22,085 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-06 08:35:22,085 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 30 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:22,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 923 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:35:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 08:35:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-02-06 08:35:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.3394833948339484) internal successors, (363), 271 states have internal predecessors, (363), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 369 transitions. [2025-02-06 08:35:22,098 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 369 transitions. Word has length 140 [2025-02-06 08:35:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 369 transitions. [2025-02-06 08:35:22,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 369 transitions. [2025-02-06 08:35:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 08:35:22,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:22,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:35:22,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -866009288, now seen corresponding path program 1 times [2025-02-06 08:35:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115662147] [2025-02-06 08:35:22,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:22,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 08:35:22,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 08:35:22,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:22,318 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-06 08:35:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115662147] [2025-02-06 08:35:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115662147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:35:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404205418] [2025-02-06 08:35:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:22,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:35:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:22,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:35:22,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:35:22,322 INFO L87 Difference]: Start difference. First operand 276 states and 369 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:22,468 INFO L93 Difference]: Finished difference Result 727 states and 977 transitions. [2025-02-06 08:35:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:35:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 140 [2025-02-06 08:35:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:22,471 INFO L225 Difference]: With dead ends: 727 [2025-02-06 08:35:22,471 INFO L226 Difference]: Without dead ends: 456 [2025-02-06 08:35:22,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:35:22,475 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 176 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:22,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 749 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:35:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-06 08:35:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2025-02-06 08:35:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 449 states have (on average 1.3452115812917596) internal successors, (604), 449 states have internal predecessors, (604), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 610 transitions. [2025-02-06 08:35:22,493 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 610 transitions. Word has length 140 [2025-02-06 08:35:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:22,493 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 610 transitions. [2025-02-06 08:35:22,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:35:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 610 transitions. [2025-02-06 08:35:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 08:35:22,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:22,500 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] [2025-02-06 08:35:22,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:35:22,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash -240672324, now seen corresponding path program 1 times [2025-02-06 08:35:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673692387] [2025-02-06 08:35:22,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:22,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 08:35:22,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 08:35:22,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:22,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:22,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673692387] [2025-02-06 08:35:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673692387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:35:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173747388] [2025-02-06 08:35:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:35:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:22,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:35:22,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:35:22,849 INFO L87 Difference]: Start difference. First operand 454 states and 610 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-06 08:35:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:23,282 INFO L93 Difference]: Finished difference Result 895 states and 1203 transitions. [2025-02-06 08:35:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:35:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 155 [2025-02-06 08:35:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:23,288 INFO L225 Difference]: With dead ends: 895 [2025-02-06 08:35:23,288 INFO L226 Difference]: Without dead ends: 532 [2025-02-06 08:35:23,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:23,290 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 761 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:23,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 929 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:35:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-06 08:35:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 362. [2025-02-06 08:35:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.3389355742296918) internal successors, (478), 357 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 484 transitions. [2025-02-06 08:35:23,311 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 484 transitions. Word has length 155 [2025-02-06 08:35:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:23,312 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 484 transitions. [2025-02-06 08:35:23,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-06 08:35:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 484 transitions. [2025-02-06 08:35:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 08:35:23,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:23,314 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:35:23,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:23,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash 511245322, now seen corresponding path program 1 times [2025-02-06 08:35:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859846960] [2025-02-06 08:35:23,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:23,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 08:35:23,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 08:35:23,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:23,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859846960] [2025-02-06 08:35:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859846960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:23,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812458637] [2025-02-06 08:35:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:23,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:23,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:35:24,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 08:35:24,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 08:35:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:24,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 08:35:24,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:24,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:35:24,384 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 16 treesize of output 17 [2025-02-06 08:35:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:25,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812458637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 08:35:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002208604] [2025-02-06 08:35:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:25,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:35:25,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:25,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:35:25,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:35:25,326 INFO L87 Difference]: Start difference. First operand 362 states and 484 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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-06 08:35:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:27,299 INFO L93 Difference]: Finished difference Result 861 states and 1155 transitions. [2025-02-06 08:35:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:35:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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 165 [2025-02-06 08:35:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:27,302 INFO L225 Difference]: With dead ends: 861 [2025-02-06 08:35:27,302 INFO L226 Difference]: Without dead ends: 543 [2025-02-06 08:35:27,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:35:27,303 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 459 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:27,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 2516 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 08:35:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-06 08:35:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 362. [2025-02-06 08:35:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.3361344537815125) internal successors, (477), 357 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 483 transitions. [2025-02-06 08:35:27,318 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 483 transitions. Word has length 165 [2025-02-06 08:35:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:27,319 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 483 transitions. [2025-02-06 08:35:27,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 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-06 08:35:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 483 transitions. [2025-02-06 08:35:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 08:35:27,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:27,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:27,333 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-06 08:35:27,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:27,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:27,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash -102134172, now seen corresponding path program 1 times [2025-02-06 08:35:27,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:27,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928435796] [2025-02-06 08:35:27,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:27,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 08:35:27,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 08:35:27,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928435796] [2025-02-06 08:35:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928435796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768907809] [2025-02-06 08:35:28,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:28,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:28,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:35:28,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 08:35:28,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 08:35:28,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:28,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:28,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 08:35:28,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:28,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:35:28,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 08:35:28,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-02-06 08:35:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:28,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768907809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-06 08:35:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856874239] [2025-02-06 08:35:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:35:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:28,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:35:28,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:28,951 INFO L87 Difference]: Start difference. First operand 362 states and 483 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 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-06 08:35:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:29,944 INFO L93 Difference]: Finished difference Result 658 states and 875 transitions. [2025-02-06 08:35:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:35:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 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 166 [2025-02-06 08:35:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:29,947 INFO L225 Difference]: With dead ends: 658 [2025-02-06 08:35:29,947 INFO L226 Difference]: Without dead ends: 543 [2025-02-06 08:35:29,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-02-06 08:35:29,949 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 355 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:29,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1942 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:35:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-06 08:35:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 398. [2025-02-06 08:35:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.3155216284987277) internal successors, (517), 393 states have internal predecessors, (517), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 523 transitions. [2025-02-06 08:35:29,971 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 523 transitions. Word has length 166 [2025-02-06 08:35:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:29,971 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 523 transitions. [2025-02-06 08:35:29,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 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-06 08:35:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 523 transitions. [2025-02-06 08:35:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 08:35:29,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:29,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:29,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:35:30,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:30,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:30,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1780254574, now seen corresponding path program 1 times [2025-02-06 08:35:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601142687] [2025-02-06 08:35:30,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:30,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 08:35:30,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 08:35:30,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:30,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601142687] [2025-02-06 08:35:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601142687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923095182] [2025-02-06 08:35:30,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:30,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:30,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:30,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:30,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:35:30,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 08:35:31,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 08:35:31,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:31,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:31,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 08:35:31,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:31,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:31,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923095182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:31,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:31,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-06 08:35:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246101544] [2025-02-06 08:35:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:31,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:35:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:31,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:35:31,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:35:31,355 INFO L87 Difference]: Start difference. First operand 398 states and 523 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-06 08:35:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:31,579 INFO L93 Difference]: Finished difference Result 513 states and 677 transitions. [2025-02-06 08:35:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:35:31,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 167 [2025-02-06 08:35:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:31,582 INFO L225 Difference]: With dead ends: 513 [2025-02-06 08:35:31,583 INFO L226 Difference]: Without dead ends: 398 [2025-02-06 08:35:31,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-06 08:35:31,584 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 17 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:31,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1120 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:35:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-06 08:35:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-02-06 08:35:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.3129770992366412) internal successors, (516), 393 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 522 transitions. [2025-02-06 08:35:31,601 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 522 transitions. Word has length 167 [2025-02-06 08:35:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:31,602 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 522 transitions. [2025-02-06 08:35:31,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-06 08:35:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 522 transitions. [2025-02-06 08:35:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 08:35:31,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:31,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:31,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 08:35:31,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:31,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:31,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1042696833, now seen corresponding path program 1 times [2025-02-06 08:35:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:31,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526136821] [2025-02-06 08:35:31,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:31,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:35:31,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:35:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:32,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526136821] [2025-02-06 08:35:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526136821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:32,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:35:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010785486] [2025-02-06 08:35:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:32,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:35:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:32,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:35:32,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:32,231 INFO L87 Difference]: Start difference. First operand 398 states and 522 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-06 08:35:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:32,523 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2025-02-06 08:35:32,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:35:32,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 168 [2025-02-06 08:35:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:32,525 INFO L225 Difference]: With dead ends: 516 [2025-02-06 08:35:32,525 INFO L226 Difference]: Without dead ends: 401 [2025-02-06 08:35:32,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:32,528 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 8 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:32,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1345 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-06 08:35:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-06 08:35:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3106060606060606) internal successors, (519), 396 states have internal predecessors, (519), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 525 transitions. [2025-02-06 08:35:32,544 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 525 transitions. Word has length 168 [2025-02-06 08:35:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:32,545 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 525 transitions. [2025-02-06 08:35:32,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-06 08:35:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 525 transitions. [2025-02-06 08:35:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:35:32,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:32,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:32,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:35:32,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:32,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1087642230, now seen corresponding path program 1 times [2025-02-06 08:35:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228404061] [2025-02-06 08:35:32,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:32,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:35:32,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:35:32,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:32,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:32,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:32,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228404061] [2025-02-06 08:35:32,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228404061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:32,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:32,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:35:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888328878] [2025-02-06 08:35:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:32,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:32,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:32,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:35:32,929 INFO L87 Difference]: Start difference. First operand 401 states and 525 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-06 08:35:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:33,280 INFO L93 Difference]: Finished difference Result 524 states and 689 transitions. [2025-02-06 08:35:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:33,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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 169 [2025-02-06 08:35:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:33,282 INFO L225 Difference]: With dead ends: 524 [2025-02-06 08:35:33,282 INFO L226 Difference]: Without dead ends: 406 [2025-02-06 08:35:33,283 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-06 08:35:33,283 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 12 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:33,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1592 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-06 08:35:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2025-02-06 08:35:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 400 states have (on average 1.31) internal successors, (524), 400 states have internal predecessors, (524), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 530 transitions. [2025-02-06 08:35:33,298 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 530 transitions. Word has length 169 [2025-02-06 08:35:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:33,299 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 530 transitions. [2025-02-06 08:35:33,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-06 08:35:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 530 transitions. [2025-02-06 08:35:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:35:33,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:33,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:33,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:35:33,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1246963098, now seen corresponding path program 1 times [2025-02-06 08:35:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:33,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138342564] [2025-02-06 08:35:33,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:33,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:35:33,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:35:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138342564] [2025-02-06 08:35:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138342564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322768326] [2025-02-06 08:35:33,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:33,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:33,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:33,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:35:33,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:35:34,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:35:34,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:34,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:34,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 08:35:34,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:34,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322768326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:34,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:34,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 08:35:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744244948] [2025-02-06 08:35:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:34,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:35:34,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:34,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:35:34,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:34,114 INFO L87 Difference]: Start difference. First operand 405 states and 530 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 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-06 08:35:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:34,271 INFO L93 Difference]: Finished difference Result 766 states and 1010 transitions. [2025-02-06 08:35:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:35:34,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 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 169 [2025-02-06 08:35:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:34,275 INFO L225 Difference]: With dead ends: 766 [2025-02-06 08:35:34,275 INFO L226 Difference]: Without dead ends: 405 [2025-02-06 08:35:34,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:34,277 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 17 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:34,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 848 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:35:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-06 08:35:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-02-06 08:35:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 400 states have (on average 1.305) internal successors, (522), 400 states have internal predecessors, (522), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 528 transitions. [2025-02-06 08:35:34,293 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 528 transitions. Word has length 169 [2025-02-06 08:35:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:34,294 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 528 transitions. [2025-02-06 08:35:34,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 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-06 08:35:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 528 transitions. [2025-02-06 08:35:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 08:35:34,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:34,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:34,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 08:35:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 08:35:34,496 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:34,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash -125268719, now seen corresponding path program 1 times [2025-02-06 08:35:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857729702] [2025-02-06 08:35:34,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:34,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 08:35:34,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 08:35:34,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:34,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857729702] [2025-02-06 08:35:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857729702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:34,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:35:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477538436] [2025-02-06 08:35:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:34,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:35:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:34,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:35:34,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:34,836 INFO L87 Difference]: Start difference. First operand 405 states and 528 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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-06 08:35:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:35,077 INFO L93 Difference]: Finished difference Result 769 states and 1012 transitions. [2025-02-06 08:35:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:35:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 170 [2025-02-06 08:35:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:35,079 INFO L225 Difference]: With dead ends: 769 [2025-02-06 08:35:35,080 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 08:35:35,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:35,081 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 8 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:35,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1106 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:35:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 08:35:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-06 08:35:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.3004926108374384) internal successors, (528), 406 states have internal predecessors, (528), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 534 transitions. [2025-02-06 08:35:35,097 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 534 transitions. Word has length 170 [2025-02-06 08:35:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:35,098 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 534 transitions. [2025-02-06 08:35:35,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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-06 08:35:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 534 transitions. [2025-02-06 08:35:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 08:35:35,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:35,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:35,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:35:35,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -823328970, now seen corresponding path program 1 times [2025-02-06 08:35:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951781121] [2025-02-06 08:35:35,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:35,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 08:35:35,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 08:35:35,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:35,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951781121] [2025-02-06 08:35:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951781121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:35:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360688540] [2025-02-06 08:35:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:35:35,420 INFO L87 Difference]: Start difference. First operand 411 states and 534 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-06 08:35:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:35,781 INFO L93 Difference]: Finished difference Result 775 states and 1016 transitions. [2025-02-06 08:35:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:35,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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 171 [2025-02-06 08:35:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:35,783 INFO L225 Difference]: With dead ends: 775 [2025-02-06 08:35:35,783 INFO L226 Difference]: Without dead ends: 421 [2025-02-06 08:35:35,784 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-06 08:35:35,784 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 12 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:35,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1586 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-06 08:35:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2025-02-06 08:35:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.2995169082125604) internal successors, (538), 414 states have internal predecessors, (538), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 544 transitions. [2025-02-06 08:35:35,802 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 544 transitions. Word has length 171 [2025-02-06 08:35:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:35,802 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 544 transitions. [2025-02-06 08:35:35,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-06 08:35:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 544 transitions. [2025-02-06 08:35:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 08:35:35,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:35,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:35,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:35:35,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash 908330614, now seen corresponding path program 1 times [2025-02-06 08:35:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24889809] [2025-02-06 08:35:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:35,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 08:35:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 08:35:35,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:36,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24889809] [2025-02-06 08:35:36,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24889809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266297502] [2025-02-06 08:35:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:36,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:36,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 08:35:36,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 08:35:36,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 08:35:36,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:36,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:36,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:35:36,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:36,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266297502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:36,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:36,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:35:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713828677] [2025-02-06 08:35:36,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:36,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:36,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:36,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:36,910 INFO L87 Difference]: Start difference. First operand 419 states and 544 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-06 08:35:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:37,322 INFO L93 Difference]: Finished difference Result 546 states and 713 transitions. [2025-02-06 08:35:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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 171 [2025-02-06 08:35:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:37,325 INFO L225 Difference]: With dead ends: 546 [2025-02-06 08:35:37,325 INFO L226 Difference]: Without dead ends: 424 [2025-02-06 08:35:37,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:37,328 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 12 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:37,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1592 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:35:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-06 08:35:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 419. [2025-02-06 08:35:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.2995169082125604) internal successors, (538), 414 states have internal predecessors, (538), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 544 transitions. [2025-02-06 08:35:37,353 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 544 transitions. Word has length 171 [2025-02-06 08:35:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:37,354 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 544 transitions. [2025-02-06 08:35:37,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-06 08:35:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 544 transitions. [2025-02-06 08:35:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 08:35:37,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:37,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:37,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 08:35:37,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 08:35:37,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:37,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 202395422, now seen corresponding path program 1 times [2025-02-06 08:35:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917061536] [2025-02-06 08:35:37,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:37,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 08:35:37,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 08:35:37,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:37,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:37,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:37,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917061536] [2025-02-06 08:35:37,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917061536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:37,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:37,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:35:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003705836] [2025-02-06 08:35:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:37,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:35:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:37,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:35:37,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:37,959 INFO L87 Difference]: Start difference. First operand 419 states and 544 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-06 08:35:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:38,305 INFO L93 Difference]: Finished difference Result 551 states and 719 transitions. [2025-02-06 08:35:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:35:38,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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 172 [2025-02-06 08:35:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:38,308 INFO L225 Difference]: With dead ends: 551 [2025-02-06 08:35:38,308 INFO L226 Difference]: Without dead ends: 429 [2025-02-06 08:35:38,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:38,309 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 20 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:38,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1681 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-06 08:35:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2025-02-06 08:35:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.299287410926366) internal successors, (547), 421 states have internal predecessors, (547), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 553 transitions. [2025-02-06 08:35:38,325 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 553 transitions. Word has length 172 [2025-02-06 08:35:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 553 transitions. [2025-02-06 08:35:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 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-06 08:35:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 553 transitions. [2025-02-06 08:35:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 08:35:38,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:38,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:35:38,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -439283442, now seen corresponding path program 1 times [2025-02-06 08:35:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144994814] [2025-02-06 08:35:38,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 08:35:38,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 08:35:38,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:38,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144994814] [2025-02-06 08:35:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144994814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189512838] [2025-02-06 08:35:38,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:38,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:38,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:38,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:38,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 08:35:39,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 08:35:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 08:35:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:39,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:35:39,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:39,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:39,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189512838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:39,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:39,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-06 08:35:39,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812457590] [2025-02-06 08:35:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:39,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:35:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:35:39,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:35:39,499 INFO L87 Difference]: Start difference. First operand 426 states and 553 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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-06 08:35:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:39,961 INFO L93 Difference]: Finished difference Result 569 states and 741 transitions. [2025-02-06 08:35:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:35:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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 172 [2025-02-06 08:35:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:39,964 INFO L225 Difference]: With dead ends: 569 [2025-02-06 08:35:39,964 INFO L226 Difference]: Without dead ends: 440 [2025-02-06 08:35:39,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:39,965 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 40 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:39,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1879 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:35:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-06 08:35:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 431. [2025-02-06 08:35:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 426 states have (on average 1.2981220657276995) internal successors, (553), 426 states have internal predecessors, (553), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 559 transitions. [2025-02-06 08:35:39,981 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 559 transitions. Word has length 172 [2025-02-06 08:35:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 559 transitions. [2025-02-06 08:35:39,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 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-06 08:35:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 559 transitions. [2025-02-06 08:35:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 08:35:39,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:39,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:40,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 08:35:40,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 08:35:40,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:40,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash 832546943, now seen corresponding path program 1 times [2025-02-06 08:35:40,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:40,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823770966] [2025-02-06 08:35:40,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:40,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:40,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 08:35:40,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 08:35:40,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:40,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823770966] [2025-02-06 08:35:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823770966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:35:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427780090] [2025-02-06 08:35:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:35:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:40,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:35:40,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:35:40,645 INFO L87 Difference]: Start difference. First operand 431 states and 559 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-06 08:35:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:41,216 INFO L93 Difference]: Finished difference Result 574 states and 749 transitions. [2025-02-06 08:35:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:35:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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 173 [2025-02-06 08:35:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:41,218 INFO L225 Difference]: With dead ends: 574 [2025-02-06 08:35:41,219 INFO L226 Difference]: Without dead ends: 440 [2025-02-06 08:35:41,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:41,220 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 23 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:41,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2415 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:35:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-06 08:35:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 434. [2025-02-06 08:35:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.2960372960372961) internal successors, (556), 429 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 562 transitions. [2025-02-06 08:35:41,238 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 562 transitions. Word has length 173 [2025-02-06 08:35:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:41,238 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 562 transitions. [2025-02-06 08:35:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 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-06 08:35:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 562 transitions. [2025-02-06 08:35:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 08:35:41,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:41,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:41,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:35:41,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash 497609843, now seen corresponding path program 1 times [2025-02-06 08:35:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:41,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485471323] [2025-02-06 08:35:41,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:41,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 08:35:41,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 08:35:41,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:41,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485471323] [2025-02-06 08:35:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485471323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835241841] [2025-02-06 08:35:41,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:41,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:41,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:41,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 08:35:41,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 08:35:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 08:35:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:42,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:35:42,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:42,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:42,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835241841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:42,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:42,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:35:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889871204] [2025-02-06 08:35:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:42,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:42,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:42,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:42,281 INFO L87 Difference]: Start difference. First operand 434 states and 562 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-06 08:35:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:42,744 INFO L93 Difference]: Finished difference Result 817 states and 1067 transitions. [2025-02-06 08:35:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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 173 [2025-02-06 08:35:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:42,746 INFO L225 Difference]: With dead ends: 817 [2025-02-06 08:35:42,746 INFO L226 Difference]: Without dead ends: 444 [2025-02-06 08:35:42,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:42,748 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 12 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:42,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1592 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:35:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-06 08:35:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 434. [2025-02-06 08:35:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.2960372960372961) internal successors, (556), 429 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 562 transitions. [2025-02-06 08:35:42,766 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 562 transitions. Word has length 173 [2025-02-06 08:35:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:42,766 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 562 transitions. [2025-02-06 08:35:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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-06 08:35:42,766 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 562 transitions. [2025-02-06 08:35:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 08:35:42,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:42,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:42,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 08:35:42,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:42,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1970033095, now seen corresponding path program 1 times [2025-02-06 08:35:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:42,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560523227] [2025-02-06 08:35:42,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:43,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 08:35:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 08:35:43,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:43,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560523227] [2025-02-06 08:35:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560523227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:43,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:43,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:35:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132043149] [2025-02-06 08:35:43,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:43,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:35:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:43,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:35:43,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:43,344 INFO L87 Difference]: Start difference. First operand 434 states and 562 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-06 08:35:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:43,713 INFO L93 Difference]: Finished difference Result 822 states and 1071 transitions. [2025-02-06 08:35:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:35:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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 174 [2025-02-06 08:35:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:43,715 INFO L225 Difference]: With dead ends: 822 [2025-02-06 08:35:43,715 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 08:35:43,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:43,717 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 20 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:43,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1926 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 08:35:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 448. [2025-02-06 08:35:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 443 states have (on average 1.2957110609480813) internal successors, (574), 443 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 580 transitions. [2025-02-06 08:35:43,740 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 580 transitions. Word has length 174 [2025-02-06 08:35:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:43,740 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 580 transitions. [2025-02-06 08:35:43,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 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-06 08:35:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 580 transitions. [2025-02-06 08:35:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 08:35:43,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:43,743 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:43,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:35:43,743 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1306459513, now seen corresponding path program 1 times [2025-02-06 08:35:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522726784] [2025-02-06 08:35:43,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:43,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 08:35:43,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 08:35:43,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:43,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522726784] [2025-02-06 08:35:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522726784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124374452] [2025-02-06 08:35:44,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:44,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:44,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:44,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:44,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 08:35:44,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 08:35:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 08:35:44,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:44,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:44,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:35:44,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:44,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124374452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-06 08:35:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638672] [2025-02-06 08:35:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:35:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:44,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:35:44,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:35:44,667 INFO L87 Difference]: Start difference. First operand 448 states and 580 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 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-06 08:35:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:45,040 INFO L93 Difference]: Finished difference Result 847 states and 1102 transitions. [2025-02-06 08:35:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:35:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 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 174 [2025-02-06 08:35:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:45,042 INFO L225 Difference]: With dead ends: 847 [2025-02-06 08:35:45,042 INFO L226 Difference]: Without dead ends: 472 [2025-02-06 08:35:45,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:45,044 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 40 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:45,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1645 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-06 08:35:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 458. [2025-02-06 08:35:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 453 states have (on average 1.293598233995585) internal successors, (586), 453 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 592 transitions. [2025-02-06 08:35:45,063 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 592 transitions. Word has length 174 [2025-02-06 08:35:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 592 transitions. [2025-02-06 08:35:45,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 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-06 08:35:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 592 transitions. [2025-02-06 08:35:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:35:45,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:45,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:45,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 08:35:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:45,267 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:45,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1709431092, now seen corresponding path program 1 times [2025-02-06 08:35:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617915501] [2025-02-06 08:35:45,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:45,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:45,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:45,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:45,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:45,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617915501] [2025-02-06 08:35:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617915501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:45,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:45,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:35:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119402452] [2025-02-06 08:35:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:45,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:35:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:45,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:35:45,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:35:45,701 INFO L87 Difference]: Start difference. First operand 458 states and 592 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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-06 08:35:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:46,206 INFO L93 Difference]: Finished difference Result 861 states and 1122 transitions. [2025-02-06 08:35:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:35:46,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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 175 [2025-02-06 08:35:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:46,209 INFO L225 Difference]: With dead ends: 861 [2025-02-06 08:35:46,209 INFO L226 Difference]: Without dead ends: 476 [2025-02-06 08:35:46,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:46,212 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 23 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:46,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2180 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:35:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-06 08:35:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 464. [2025-02-06 08:35:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 459 states have (on average 1.289760348583878) internal successors, (592), 459 states have internal predecessors, (592), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 598 transitions. [2025-02-06 08:35:46,227 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 598 transitions. Word has length 175 [2025-02-06 08:35:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:46,228 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 598 transitions. [2025-02-06 08:35:46,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 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-06 08:35:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 598 transitions. [2025-02-06 08:35:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:35:46,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:46,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:46,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:35:46,230 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:46,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash 473075884, now seen corresponding path program 1 times [2025-02-06 08:35:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264216863] [2025-02-06 08:35:46,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:46,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:46,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:46,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:46,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264216863] [2025-02-06 08:35:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264216863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574521882] [2025-02-06 08:35:46,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:46,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:46,594 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:46,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 08:35:46,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:47,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:47,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:47,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:47,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 08:35:47,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:47,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574521882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:47,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:47,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:35:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237042182] [2025-02-06 08:35:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:47,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:47,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:47,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:47,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:47,151 INFO L87 Difference]: Start difference. First operand 464 states and 598 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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-06 08:35:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:47,424 INFO L93 Difference]: Finished difference Result 861 states and 1117 transitions. [2025-02-06 08:35:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:35:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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 175 [2025-02-06 08:35:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:47,427 INFO L225 Difference]: With dead ends: 861 [2025-02-06 08:35:47,427 INFO L226 Difference]: Without dead ends: 478 [2025-02-06 08:35:47,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:35:47,428 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 39 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:47,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1598 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:35:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-06 08:35:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 458. [2025-02-06 08:35:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 453 states have (on average 1.2891832229580573) internal successors, (584), 453 states have internal predecessors, (584), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 590 transitions. [2025-02-06 08:35:47,443 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 590 transitions. Word has length 175 [2025-02-06 08:35:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:47,443 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 590 transitions. [2025-02-06 08:35:47,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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-06 08:35:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 590 transitions. [2025-02-06 08:35:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:35:47,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:47,445 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:47,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 08:35:47,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:47,645 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:47,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1581622768, now seen corresponding path program 1 times [2025-02-06 08:35:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504520149] [2025-02-06 08:35:47,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:47,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:47,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:47,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:47,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:48,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504520149] [2025-02-06 08:35:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504520149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:48,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511803155] [2025-02-06 08:35:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:48,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:48,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:48,014 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:48,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 08:35:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:48,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:48,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:48,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:48,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:35:48,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:48,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511803155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:48,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:48,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:35:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830593299] [2025-02-06 08:35:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:48,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:48,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:48,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:48,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:48,872 INFO L87 Difference]: Start difference. First operand 458 states and 590 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-06 08:35:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:49,253 INFO L93 Difference]: Finished difference Result 600 states and 777 transitions. [2025-02-06 08:35:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 175 [2025-02-06 08:35:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:49,256 INFO L225 Difference]: With dead ends: 600 [2025-02-06 08:35:49,256 INFO L226 Difference]: Without dead ends: 463 [2025-02-06 08:35:49,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:49,257 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 10 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:49,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1592 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:35:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-02-06 08:35:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2025-02-06 08:35:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 453 states have (on average 1.2891832229580573) internal successors, (584), 453 states have internal predecessors, (584), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 590 transitions. [2025-02-06 08:35:49,274 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 590 transitions. Word has length 175 [2025-02-06 08:35:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:49,274 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 590 transitions. [2025-02-06 08:35:49,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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-06 08:35:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 590 transitions. [2025-02-06 08:35:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:35:49,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:49,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:49,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 08:35:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 08:35:49,477 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1377804116, now seen corresponding path program 1 times [2025-02-06 08:35:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593885668] [2025-02-06 08:35:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:49,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:49,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:49,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:49,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593885668] [2025-02-06 08:35:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593885668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636455641] [2025-02-06 08:35:49,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:49,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:49,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:49,810 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:49,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 08:35:50,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:50,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:50,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:50,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:50,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 08:35:50,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:35:50,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636455641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:50,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:50,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-06 08:35:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325848776] [2025-02-06 08:35:50,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:50,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:35:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:50,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:35:50,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:35:50,483 INFO L87 Difference]: Start difference. First operand 458 states and 590 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 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-06 08:35:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:50,802 INFO L93 Difference]: Finished difference Result 605 states and 783 transitions. [2025-02-06 08:35:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:35:50,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 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 175 [2025-02-06 08:35:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:50,805 INFO L225 Difference]: With dead ends: 605 [2025-02-06 08:35:50,805 INFO L226 Difference]: Without dead ends: 468 [2025-02-06 08:35:50,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:35:50,807 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 16 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:50,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1894 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-06 08:35:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 465. [2025-02-06 08:35:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 460 states have (on average 1.2891304347826087) internal successors, (593), 460 states have internal predecessors, (593), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 599 transitions. [2025-02-06 08:35:50,821 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 599 transitions. Word has length 175 [2025-02-06 08:35:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:50,821 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 599 transitions. [2025-02-06 08:35:50,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 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-06 08:35:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 599 transitions. [2025-02-06 08:35:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:35:50,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:50,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:50,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 08:35:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 08:35:51,024 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash -795615732, now seen corresponding path program 1 times [2025-02-06 08:35:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106310800] [2025-02-06 08:35:51,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:51,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:51,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:51,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106310800] [2025-02-06 08:35:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106310800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420013643] [2025-02-06 08:35:51,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:51,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:51,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:51,388 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 08:35:51,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:35:51,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:35:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:51,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 08:35:51,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:52,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-06 08:35:52,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420013643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-06 08:35:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850969023] [2025-02-06 08:35:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:52,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:35:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:35:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:52,315 INFO L87 Difference]: Start difference. First operand 465 states and 599 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-06 08:35:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:53,161 INFO L93 Difference]: Finished difference Result 619 states and 803 transitions. [2025-02-06 08:35:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:35:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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 175 [2025-02-06 08:35:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:53,164 INFO L225 Difference]: With dead ends: 619 [2025-02-06 08:35:53,164 INFO L226 Difference]: Without dead ends: 475 [2025-02-06 08:35:53,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:35:53,165 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 17 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:53,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2378 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 08:35:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-06 08:35:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 472. [2025-02-06 08:35:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.2890792291220556) internal successors, (602), 467 states have internal predecessors, (602), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 608 transitions. [2025-02-06 08:35:53,186 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 608 transitions. Word has length 175 [2025-02-06 08:35:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 608 transitions. [2025-02-06 08:35:53,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-06 08:35:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 608 transitions. [2025-02-06 08:35:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 08:35:53,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:53,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:53,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 08:35:53,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:53,390 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:53,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -3157793, now seen corresponding path program 1 times [2025-02-06 08:35:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445691512] [2025-02-06 08:35:53,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:53,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 08:35:53,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 08:35:53,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:53,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:53,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:53,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445691512] [2025-02-06 08:35:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445691512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913696529] [2025-02-06 08:35:53,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:53,719 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:53,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 08:35:54,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 08:35:54,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 08:35:54,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:54,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:54,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:35:54,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:54,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:35:54,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913696529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:54,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:35:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-06 08:35:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42427666] [2025-02-06 08:35:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:54,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:54,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:54,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:54,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:54,453 INFO L87 Difference]: Start difference. First operand 472 states and 608 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-06 08:35:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:54,765 INFO L93 Difference]: Finished difference Result 881 states and 1145 transitions. [2025-02-06 08:35:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:54,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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 176 [2025-02-06 08:35:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:54,767 INFO L225 Difference]: With dead ends: 881 [2025-02-06 08:35:54,767 INFO L226 Difference]: Without dead ends: 482 [2025-02-06 08:35:54,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:35:54,768 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 10 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:54,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1592 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-06 08:35:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2025-02-06 08:35:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 467 states have (on average 1.2890792291220556) internal successors, (602), 467 states have internal predecessors, (602), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 08:35:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 608 transitions. [2025-02-06 08:35:54,787 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 608 transitions. Word has length 176 [2025-02-06 08:35:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:54,788 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 608 transitions. [2025-02-06 08:35:54,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-06 08:35:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 608 transitions. [2025-02-06 08:35:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-06 08:35:54,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:54,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:35:54,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 08:35:54,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:54,990 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 555019331, now seen corresponding path program 1 times [2025-02-06 08:35:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545033028] [2025-02-06 08:35:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:55,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 08:35:55,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 08:35:55,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:55,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:35:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545033028] [2025-02-06 08:35:55,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545033028] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855320431] [2025-02-06 08:35:55,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:55,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:55,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:55,310 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:55,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 08:35:55,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-06 08:35:56,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-06 08:35:56,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:56,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:56,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-06 08:35:56,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:56,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 08:35:56,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 08:35:56,480 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-06 08:35:56,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-06 08:35:56,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:35:56,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 08:35:56,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 08:36:01,099 INFO L224 Elim1Store]: Index analysis took 334 ms