./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.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_BER_test3-2.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 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:32:51,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:32:51,406 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:32:51,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:32:51,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:32:51,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:32:51,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:32:51,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:32:51,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:32:51,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:32:51,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:32:51,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:32:51,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:32:51,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:32:51,432 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:32:51,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:32:51,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:32:51,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:32:51,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:32:51,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:32:51,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:32:51,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:32:51,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:32:51,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:32:51,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:32:51,435 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 -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2025-02-06 08:32:51,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:32:51,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:32:51,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:32:51,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:32:51,670 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:32:51,671 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_BER_test3-2.i [2025-02-06 08:32:52,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce453ff78/b1042540543246fab15639083701c200/FLAGa3d16c451 [2025-02-06 08:32:53,118 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:32:53,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2025-02-06 08:32:53,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce453ff78/b1042540543246fab15639083701c200/FLAGa3d16c451 [2025-02-06 08:32:53,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce453ff78/b1042540543246fab15639083701c200 [2025-02-06 08:32:53,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:32:53,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:32:53,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:32:53,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:32:53,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:32:53,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:53,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c0f257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53, skipping insertion in model container [2025-02-06 08:32:53,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:53,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:32:53,652 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_BER_test3-2.i[33021,33034] [2025-02-06 08:32:53,734 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_BER_test3-2.i[44590,44603] [2025-02-06 08:32:53,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:32:53,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:32:53,782 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_BER_test3-2.i[33021,33034] [2025-02-06 08:32:53,830 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_BER_test3-2.i[44590,44603] [2025-02-06 08:32:53,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:32:53,865 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:32:53,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53 WrapperNode [2025-02-06 08:32:53,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:32:53,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:32:53,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:32:53,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:32:53,871 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:32:53" (1/1) ... [2025-02-06 08:32:53,893 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:32:53" (1/1) ... [2025-02-06 08:32:53,949 INFO L138 Inliner]: procedures = 177, calls = 328, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1569 [2025-02-06 08:32:53,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:32:53,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:32:53,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:32:53,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:32:53,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:53,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:53,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,048 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-02-06 08:32:54,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:32:54,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:32:54,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:32:54,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:32:54,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (1/1) ... [2025-02-06 08:32:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:32:54,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:32:54,135 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:32:54,139 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:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:32:54,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:32:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:32:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:32:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:32:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:32:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:32:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:32:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:32:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:32:54,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:32:54,370 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:32:54,371 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:32:55,403 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:32:55,485 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-02-06 08:32:55,485 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:32:55,541 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:32:55,543 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:32:55,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:32:55 BoogieIcfgContainer [2025-02-06 08:32:55,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:32:55,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:32:55,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:32:55,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:32:55,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:32:53" (1/3) ... [2025-02-06 08:32:55,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6528d4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:32:55, skipping insertion in model container [2025-02-06 08:32:55,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:32:53" (2/3) ... [2025-02-06 08:32:55,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6528d4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:32:55, skipping insertion in model container [2025-02-06 08:32:55,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:32:55" (3/3) ... [2025-02-06 08:32:55,550 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-2.i [2025-02-06 08:32:55,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:32:55,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test3-2.i that has 5 procedures, 448 locations, 1 initial locations, 43 loop locations, and 2 error locations. [2025-02-06 08:32:55,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:32:55,618 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;@71226037, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:32:55,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:32:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 427 states have (on average 1.620608899297424) internal successors, (692), 434 states have internal predecessors, (692), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:32:55,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:55,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:55,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 190894067, now seen corresponding path program 1 times [2025-02-06 08:32:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:55,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890170768] [2025-02-06 08:32:55,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:55,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:32:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:32:55,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:55,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:55,754 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:32:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890170768] [2025-02-06 08:32:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890170768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:32:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931364055] [2025-02-06 08:32:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:55,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:32:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:55,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:32:55,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:32:55,776 INFO L87 Difference]: Start difference. First operand has 440 states, 427 states have (on average 1.620608899297424) internal successors, (692), 434 states have internal predecessors, (692), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:55,858 INFO L93 Difference]: Finished difference Result 878 states and 1419 transitions. [2025-02-06 08:32:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:32:55,859 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 08:32:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:55,870 INFO L225 Difference]: With dead ends: 878 [2025-02-06 08:32:55,872 INFO L226 Difference]: Without dead ends: 404 [2025-02-06 08:32:55,878 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:32:55,879 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:55,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:32:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-06 08:32:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-06 08:32:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 398 states have internal predecessors, (571), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 587 transitions. [2025-02-06 08:32:55,922 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 587 transitions. Word has length 9 [2025-02-06 08:32:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:55,922 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 587 transitions. [2025-02-06 08:32:55,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 587 transitions. [2025-02-06 08:32:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 08:32:55,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:55,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:55,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:32:55,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1646412687, now seen corresponding path program 1 times [2025-02-06 08:32:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671628818] [2025-02-06 08:32:55,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:55,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 08:32:55,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 08:32:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:56,075 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:32:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671628818] [2025-02-06 08:32:56,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671628818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:56,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:56,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426485544] [2025-02-06 08:32:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:56,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:56,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:56,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:56,081 INFO L87 Difference]: Start difference. First operand 404 states and 587 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:56,358 INFO L93 Difference]: Finished difference Result 1000 states and 1462 transitions. [2025-02-06 08:32:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:32:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 08:32:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:56,362 INFO L225 Difference]: With dead ends: 1000 [2025-02-06 08:32:56,364 INFO L226 Difference]: Without dead ends: 795 [2025-02-06 08:32:56,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:32:56,366 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 556 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:56,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1647 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:32:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-06 08:32:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 406. [2025-02-06 08:32:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2025-02-06 08:32:56,386 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 14 [2025-02-06 08:32:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:56,386 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2025-02-06 08:32:56,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2025-02-06 08:32:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:32:56,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:56,389 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] [2025-02-06 08:32:56,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:32:56,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:56,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1597532617, now seen corresponding path program 1 times [2025-02-06 08:32:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769498762] [2025-02-06 08:32:56,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:32:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:32:56,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:56,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:56,767 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:32:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769498762] [2025-02-06 08:32:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769498762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:56,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933070889] [2025-02-06 08:32:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:56,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:56,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:56,769 INFO L87 Difference]: Start difference. First operand 406 states and 589 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:56,913 INFO L93 Difference]: Finished difference Result 766 states and 1108 transitions. [2025-02-06 08:32:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:32:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-06 08:32:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:56,916 INFO L225 Difference]: With dead ends: 766 [2025-02-06 08:32:56,916 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 08:32:56,917 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:32:56,917 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 30 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:56,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1340 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 08:32:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-06 08:32:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 352 states have (on average 1.4090909090909092) internal successors, (496), 358 states have internal predecessors, (496), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 512 transitions. [2025-02-06 08:32:56,934 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 512 transitions. Word has length 89 [2025-02-06 08:32:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:56,934 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 512 transitions. [2025-02-06 08:32:56,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 512 transitions. [2025-02-06 08:32:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:32:56,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:56,936 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] [2025-02-06 08:32:56,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:32:56,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:56,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 304650960, now seen corresponding path program 1 times [2025-02-06 08:32:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22323635] [2025-02-06 08:32:56,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:56,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:56,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:32:56,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:32:56,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:56,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:57,110 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:32:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22323635] [2025-02-06 08:32:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22323635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:57,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:57,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:32:57,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166506612] [2025-02-06 08:32:57,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:57,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:32:57,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:57,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:32:57,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:32:57,114 INFO L87 Difference]: Start difference. First operand 364 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:57,293 INFO L93 Difference]: Finished difference Result 986 states and 1402 transitions. [2025-02-06 08:32:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:32:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-06 08:32:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:57,298 INFO L225 Difference]: With dead ends: 986 [2025-02-06 08:32:57,298 INFO L226 Difference]: Without dead ends: 626 [2025-02-06 08:32:57,299 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:32:57,299 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 308 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:57,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1112 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:32:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-02-06 08:32:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 609. [2025-02-06 08:32:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 597 states have (on average 1.423785594639866) internal successors, (850), 603 states have internal predecessors, (850), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 866 transitions. [2025-02-06 08:32:57,323 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 866 transitions. Word has length 89 [2025-02-06 08:32:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:57,325 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 866 transitions. [2025-02-06 08:32:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:32:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 866 transitions. [2025-02-06 08:32:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:32:57,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:57,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:32:57,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:32:57,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash 662566911, now seen corresponding path program 1 times [2025-02-06 08:32:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196817647] [2025-02-06 08:32:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:57,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:32:57,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:32:57,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:57,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:57,725 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:32:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196817647] [2025-02-06 08:32:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196817647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240339572] [2025-02-06 08:32:57,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:57,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:57,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:57,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:57,728 INFO L87 Difference]: Start difference. First operand 609 states and 866 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:32:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:57,919 INFO L93 Difference]: Finished difference Result 905 states and 1288 transitions. [2025-02-06 08:32:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:32:57,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:32:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:57,926 INFO L225 Difference]: With dead ends: 905 [2025-02-06 08:32:57,926 INFO L226 Difference]: Without dead ends: 885 [2025-02-06 08:32:57,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:32:57,928 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 455 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:57,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1428 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:32:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-06 08:32:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 611. [2025-02-06 08:32:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 599 states have (on average 1.4223706176961604) internal successors, (852), 605 states have internal predecessors, (852), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 868 transitions. [2025-02-06 08:32:57,952 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 868 transitions. Word has length 104 [2025-02-06 08:32:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:57,952 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 868 transitions. [2025-02-06 08:32:57,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:32:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 868 transitions. [2025-02-06 08:32:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:32:57,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:57,955 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] [2025-02-06 08:32:57,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:32:57,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:57,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1398565401, now seen corresponding path program 1 times [2025-02-06 08:32:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729022575] [2025-02-06 08:32:57,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:57,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:32:58,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:32:58,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:58,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:58,177 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:32:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729022575] [2025-02-06 08:32:58,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729022575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:58,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:58,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224451023] [2025-02-06 08:32:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:58,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:58,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:58,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:58,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:58,179 INFO L87 Difference]: Start difference. First operand 611 states and 868 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:32:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:58,286 INFO L93 Difference]: Finished difference Result 904 states and 1292 transitions. [2025-02-06 08:32:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:32:58,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:32:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:58,289 INFO L225 Difference]: With dead ends: 904 [2025-02-06 08:32:58,289 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 08:32:58,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:32:58,290 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 23 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:58,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1116 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 08:32:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2025-02-06 08:32:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 527 states have (on average 1.3586337760910816) internal successors, (716), 533 states have internal predecessors, (716), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 732 transitions. [2025-02-06 08:32:58,310 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 732 transitions. Word has length 153 [2025-02-06 08:32:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:58,310 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 732 transitions. [2025-02-06 08:32:58,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:32:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 732 transitions. [2025-02-06 08:32:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:32:58,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:58,312 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] [2025-02-06 08:32:58,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:32:58,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -234238598, now seen corresponding path program 1 times [2025-02-06 08:32:58,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:58,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925554473] [2025-02-06 08:32:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:58,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:32:58,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:32:58,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:58,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:58,525 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:32:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:58,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925554473] [2025-02-06 08:32:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925554473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:58,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586834269] [2025-02-06 08:32:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:58,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:58,527 INFO L87 Difference]: Start difference. First operand 539 states and 732 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:32:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:58,637 INFO L93 Difference]: Finished difference Result 806 states and 1108 transitions. [2025-02-06 08:32:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:32:58,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:32:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:58,640 INFO L225 Difference]: With dead ends: 806 [2025-02-06 08:32:58,640 INFO L226 Difference]: Without dead ends: 515 [2025-02-06 08:32:58,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:32:58,641 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 27 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:58,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1113 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:32:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-06 08:32:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-02-06 08:32:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 503 states have (on average 1.3479125248508945) internal successors, (678), 509 states have internal predecessors, (678), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 694 transitions. [2025-02-06 08:32:58,652 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 694 transitions. Word has length 153 [2025-02-06 08:32:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:58,652 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 694 transitions. [2025-02-06 08:32:58,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:32:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 694 transitions. [2025-02-06 08:32:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:32:58,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:58,654 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] [2025-02-06 08:32:58,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:32:58,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 641584339, now seen corresponding path program 1 times [2025-02-06 08:32:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511647124] [2025-02-06 08:32:58,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:58,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:32:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:32:58,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:58,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:58,847 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:32:58,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:58,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511647124] [2025-02-06 08:32:58,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511647124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:32:58,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:32:58,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:32:58,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169557622] [2025-02-06 08:32:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:32:58,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:32:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:32:58,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:32:58,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:32:58,853 INFO L87 Difference]: Start difference. First operand 515 states and 694 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:32:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:32:59,288 INFO L93 Difference]: Finished difference Result 1102 states and 1496 transitions. [2025-02-06 08:32:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:32:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 153 [2025-02-06 08:32:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:32:59,291 INFO L225 Difference]: With dead ends: 1102 [2025-02-06 08:32:59,291 INFO L226 Difference]: Without dead ends: 677 [2025-02-06 08:32:59,292 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:32:59,293 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 822 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:32:59,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 828 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:32:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-06 08:32:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 647. [2025-02-06 08:32:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 635 states have (on average 1.3480314960629922) internal successors, (856), 641 states have internal predecessors, (856), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 08:32:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 872 transitions. [2025-02-06 08:32:59,315 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 872 transitions. Word has length 153 [2025-02-06 08:32:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:32:59,315 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 872 transitions. [2025-02-06 08:32:59,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:32:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 872 transitions. [2025-02-06 08:32:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:32:59,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:32:59,317 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] [2025-02-06 08:32:59,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:32:59,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:32:59,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:32:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 580578213, now seen corresponding path program 1 times [2025-02-06 08:32:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:32:59,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051800813] [2025-02-06 08:32:59,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:32:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:32:59,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:32:59,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:32:59,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:32:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:32:59,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:32:59,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051800813] [2025-02-06 08:32:59,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051800813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:32:59,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683537702] [2025-02-06 08:32:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:32:59,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:32:59,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:32:59,950 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:32:59,979 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:33:00,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:33:00,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:33:00,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:33:00,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:33:00,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:33:00,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:33:00,314 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:33:00,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:33:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:33:00,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:33:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:33:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683537702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:33:00,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:33:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-02-06 08:33:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005803129] [2025-02-06 08:33:00,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:33:00,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:33:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:33:00,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:33:00,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:33:00,697 INFO L87 Difference]: Start difference. First operand 647 states and 872 transitions. Second operand has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:33:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:33:01,141 INFO L93 Difference]: Finished difference Result 2083 states and 2812 transitions. [2025-02-06 08:33:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:33:01,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-02-06 08:33:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:33:01,147 INFO L225 Difference]: With dead ends: 2083 [2025-02-06 08:33:01,147 INFO L226 Difference]: Without dead ends: 1681 [2025-02-06 08:33:01,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:33:01,149 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 1071 mSDsluCounter, 4104 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:33:01,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 4651 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:33:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-02-06 08:33:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 989. [2025-02-06 08:33:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 973 states have (on average 1.3442959917780062) internal successors, (1308), 979 states have internal predecessors, (1308), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 08:33:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1330 transitions. [2025-02-06 08:33:01,180 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1330 transitions. Word has length 163 [2025-02-06 08:33:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:33:01,180 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1330 transitions. [2025-02-06 08:33:01,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:33:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1330 transitions. [2025-02-06 08:33:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 08:33:01,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:33:01,184 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:33:01,194 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:33:01,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:33:01,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:33:01,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:33:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash 826694660, now seen corresponding path program 1 times [2025-02-06 08:33:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:33:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794581399] [2025-02-06 08:33:01,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:33:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:33:01,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:33:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:33:01,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:33:01,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:33:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:33:03,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:33:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794581399] [2025-02-06 08:33:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794581399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:33:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365217635] [2025-02-06 08:33:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:33:03,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:33:03,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:33:03,952 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:33:03,953 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:33:04,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:33:04,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:33:04,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:33:04,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:33:04,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 08:33:04,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:33:04,498 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:33:04,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:33:04,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:33:04,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:33:04,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:33:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:33:04,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:33:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:33:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365217635] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:33:05,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:33:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-02-06 08:33:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666728681] [2025-02-06 08:33:05,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:33:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 08:33:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:33:05,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 08:33:05,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-06 08:33:05,467 INFO L87 Difference]: Start difference. First operand 989 states and 1330 transitions. Second operand has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:33:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:33:06,668 INFO L93 Difference]: Finished difference Result 4114 states and 5569 transitions. [2025-02-06 08:33:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 08:33:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 388 [2025-02-06 08:33:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:33:06,683 INFO L225 Difference]: With dead ends: 4114 [2025-02-06 08:33:06,683 INFO L226 Difference]: Without dead ends: 3712 [2025-02-06 08:33:06,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 764 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-06 08:33:06,686 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 4413 mSDsluCounter, 11248 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 12650 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:33:06,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 12650 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:33:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2025-02-06 08:33:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 1841. [2025-02-06 08:33:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1819 states have (on average 1.3424958768554152) internal successors, (2442), 1825 states have internal predecessors, (2442), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 08:33:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2476 transitions. [2025-02-06 08:33:06,758 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2476 transitions. Word has length 388 [2025-02-06 08:33:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:33:06,760 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2476 transitions. [2025-02-06 08:33:06,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:33:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2476 transitions. [2025-02-06 08:33:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-06 08:33:06,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:33:06,777 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:33:06,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:33:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:33:06,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:33:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:33:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1820239908, now seen corresponding path program 2 times [2025-02-06 08:33:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:33:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878452458] [2025-02-06 08:33:06,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:33:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:33:07,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 838 statements into 2 equivalence classes. [2025-02-06 08:33:07,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 838 statements. [2025-02-06 08:33:07,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:33:07,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:33:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:33:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:33:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878452458] [2025-02-06 08:33:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878452458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:33:07,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:33:07,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:33:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826772478] [2025-02-06 08:33:07,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:33:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:33:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:33:07,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:33:07,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:33:07,402 INFO L87 Difference]: Start difference. First operand 1841 states and 2476 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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:33:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:33:07,724 INFO L93 Difference]: Finished difference Result 2255 states and 3041 transitions. [2025-02-06 08:33:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:33:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 838 [2025-02-06 08:33:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:33:07,731 INFO L225 Difference]: With dead ends: 2255 [2025-02-06 08:33:07,731 INFO L226 Difference]: Without dead ends: 1856 [2025-02-06 08:33:07,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:33:07,733 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 10 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:33:07,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1640 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:33:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2025-02-06 08:33:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1847. [2025-02-06 08:33:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1825 states have (on average 1.3413698630136985) internal successors, (2448), 1831 states have internal predecessors, (2448), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 08:33:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2482 transitions. [2025-02-06 08:33:07,803 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2482 transitions. Word has length 838 [2025-02-06 08:33:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:33:07,806 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2482 transitions. [2025-02-06 08:33:07,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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:33:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2482 transitions. [2025-02-06 08:33:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:33:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:33:07,821 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:33:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:33:07,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:33:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:33:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1741427789, now seen corresponding path program 1 times [2025-02-06 08:33:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:33:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669354935] [2025-02-06 08:33:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:33:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:33:07,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:34:15,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:34:15,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 497 proven. 3 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2025-02-06 08:34:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669354935] [2025-02-06 08:34:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669354935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:34:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848361771] [2025-02-06 08:34:16,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:16,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:16,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:16,221 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:34:16,222 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:34:16,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:34:20,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:34:20,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:20,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:20,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 4161 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 08:34:20,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:34:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 3073 trivial. 0 not checked. [2025-02-06 08:34:20,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:34:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848361771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:20,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:34:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-02-06 08:34:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949772217] [2025-02-06 08:34:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:20,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:34:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:20,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:34:20,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:34:20,262 INFO L87 Difference]: Start difference. First operand 1847 states and 2482 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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:34:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:20,476 INFO L93 Difference]: Finished difference Result 3701 states and 4994 transitions. [2025-02-06 08:34:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:34:20,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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 839 [2025-02-06 08:34:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:20,515 INFO L225 Difference]: With dead ends: 3701 [2025-02-06 08:34:20,516 INFO L226 Difference]: Without dead ends: 1897 [2025-02-06 08:34:20,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:34:20,517 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 12 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:20,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1638 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:34:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2025-02-06 08:34:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1887. [2025-02-06 08:34:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1865 states have (on average 1.328686327077748) internal successors, (2478), 1871 states have internal predecessors, (2478), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 08:34:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2512 transitions. [2025-02-06 08:34:20,591 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2512 transitions. Word has length 839 [2025-02-06 08:34:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:20,591 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2512 transitions. [2025-02-06 08:34:20,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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:34:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2512 transitions. [2025-02-06 08:34:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2025-02-06 08:34:20,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:20,605 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:20,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:34:20,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:20,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1939398317, now seen corresponding path program 1 times [2025-02-06 08:34:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004309497] [2025-02-06 08:34:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:21,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 859 statements into 1 equivalence classes. [2025-02-06 08:34:21,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 859 of 859 statements. [2025-02-06 08:34:21,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 3145 trivial. 0 not checked. [2025-02-06 08:34:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004309497] [2025-02-06 08:34:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004309497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:34:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428422170] [2025-02-06 08:34:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:34:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:22,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:34:22,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:34:22,165 INFO L87 Difference]: Start difference. First operand 1887 states and 2512 transitions. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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:34:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:22,367 INFO L93 Difference]: Finished difference Result 3754 states and 5016 transitions. [2025-02-06 08:34:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:34:22,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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 859 [2025-02-06 08:34:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:22,377 INFO L225 Difference]: With dead ends: 3754 [2025-02-06 08:34:22,377 INFO L226 Difference]: Without dead ends: 1917 [2025-02-06 08:34:22,384 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:34:22,384 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 8 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:22,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1359 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:34:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-02-06 08:34:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1917. [2025-02-06 08:34:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1895 states have (on average 1.3234828496042217) internal successors, (2508), 1901 states have internal predecessors, (2508), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 08:34:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2542 transitions. [2025-02-06 08:34:22,434 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2542 transitions. Word has length 859 [2025-02-06 08:34:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:22,435 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 2542 transitions. [2025-02-06 08:34:22,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 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:34:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2542 transitions. [2025-02-06 08:34:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-02-06 08:34:22,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:22,444 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:22,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:34:22,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash -257738837, now seen corresponding path program 1 times [2025-02-06 08:34:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130692431] [2025-02-06 08:34:22,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:22,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes.