./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:36:08,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:36:08,616 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:36:08,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:36:08,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:36:08,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:36:08,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:36:08,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:36:08,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:36:08,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:36:08,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:36:08,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:36:08,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:36:08,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:36:08,648 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:36:08,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:36:08,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:36:08,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:36:08,650 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:36:08,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:36:08,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:36:08,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:36:08,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:36:08,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:36:08,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:36:08,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:36:08,651 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 -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2025-02-06 08:36:08,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:36:08,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:36:08,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:36:08,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:36:08,905 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:36:08,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2025-02-06 08:36:10,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f65e54e/3771eddba62a49d8bf4f12618dbd9d97/FLAG8a7cffec7 [2025-02-06 08:36:10,429 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:36:10,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2025-02-06 08:36:10,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f65e54e/3771eddba62a49d8bf4f12618dbd9d97/FLAG8a7cffec7 [2025-02-06 08:36:10,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13f65e54e/3771eddba62a49d8bf4f12618dbd9d97 [2025-02-06 08:36:10,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:36:10,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:36:10,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:36:10,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:36:10,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:36:10,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:36:10" (1/1) ... [2025-02-06 08:36:10,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1794836c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:10, skipping insertion in model container [2025-02-06 08:36:10,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:36:10" (1/1) ... [2025-02-06 08:36:10,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:36:10,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i[33022,33035] [2025-02-06 08:36:10,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:36:11,001 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:36:11,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i[33022,33035] [2025-02-06 08:36:11,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:36:11,172 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:36:11,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11 WrapperNode [2025-02-06 08:36:11,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:36:11,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:36:11,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:36:11,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:36:11,178 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:36:11" (1/1) ... [2025-02-06 08:36:11,201 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:36:11" (1/1) ... [2025-02-06 08:36:11,277 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3305 [2025-02-06 08:36:11,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:36:11,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:36:11,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:36:11,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:36:11,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,437 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2025-02-06 08:36:11,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:36:11,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:36:11,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:36:11,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:36:11,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (1/1) ... [2025-02-06 08:36:11,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:36:11,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:36:11,566 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:36:11,574 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:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-06 08:36:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:36:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:36:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:36:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:36:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:36:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:36:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:36:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:36:11,854 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:36:11,856 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:36:14,313 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: 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:36:14,535 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-02-06 08:36:14,535 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:36:14,606 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:36:14,606 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 08:36:14,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:36:14 BoogieIcfgContainer [2025-02-06 08:36:14,606 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:36:14,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:36:14,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:36:14,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:36:14,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:36:10" (1/3) ... [2025-02-06 08:36:14,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38822529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:36:14, skipping insertion in model container [2025-02-06 08:36:14,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:36:11" (2/3) ... [2025-02-06 08:36:14,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38822529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:36:14, skipping insertion in model container [2025-02-06 08:36:14,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:36:14" (3/3) ... [2025-02-06 08:36:14,613 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-1.i [2025-02-06 08:36:14,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:36:14,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test10-1.i that has 6 procedures, 1030 locations, 1 initial locations, 84 loop locations, and 1 error locations. [2025-02-06 08:36:14,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:36:14,684 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;@7c5eef68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:36:14,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:36:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 1022 states, 1003 states have (on average 1.621136590229312) internal successors, (1626), 1008 states have internal predecessors, (1626), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 08:36:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 08:36:14,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:14,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:36:14,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1020466179, now seen corresponding path program 1 times [2025-02-06 08:36:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:14,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608641658] [2025-02-06 08:36:14,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:14,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 08:36:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 08:36:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:14,815 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:36:14,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608641658] [2025-02-06 08:36:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608641658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:14,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:36:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270095491] [2025-02-06 08:36:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:36:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:14,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:36:14,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:36:14,833 INFO L87 Difference]: Start difference. First operand has 1022 states, 1003 states have (on average 1.621136590229312) internal successors, (1626), 1008 states have internal predecessors, (1626), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:15,041 INFO L93 Difference]: Finished difference Result 2042 states and 3314 transitions. [2025-02-06 08:36:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:36:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 08:36:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:15,052 INFO L225 Difference]: With dead ends: 2042 [2025-02-06 08:36:15,052 INFO L226 Difference]: Without dead ends: 1018 [2025-02-06 08:36:15,058 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:36:15,060 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:15,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1387 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:36:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-02-06 08:36:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-02-06 08:36:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1000 states have (on average 1.476) internal successors, (1476), 1005 states have internal predecessors, (1476), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:36:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1503 transitions. [2025-02-06 08:36:15,148 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1503 transitions. Word has length 13 [2025-02-06 08:36:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:15,150 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1503 transitions. [2025-02-06 08:36:15,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1503 transitions. [2025-02-06 08:36:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:36:15,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:15,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:36:15,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:36:15,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 440676235, now seen corresponding path program 1 times [2025-02-06 08:36:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836039247] [2025-02-06 08:36:15,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:15,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:36:15,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:36:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:15,597 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:36:15,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:15,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836039247] [2025-02-06 08:36:15,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836039247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:15,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:15,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:36:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901907031] [2025-02-06 08:36:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:36:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:15,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:36:15,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:36:15,601 INFO L87 Difference]: Start difference. First operand 1018 states and 1503 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:15,989 INFO L93 Difference]: Finished difference Result 2030 states and 3000 transitions. [2025-02-06 08:36:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:36:15,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:36:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:15,995 INFO L225 Difference]: With dead ends: 2030 [2025-02-06 08:36:15,995 INFO L226 Difference]: Without dead ends: 1400 [2025-02-06 08:36:15,996 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:36:15,996 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 544 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:15,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4149 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:36:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-02-06 08:36:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1020. [2025-02-06 08:36:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1002 states have (on average 1.4750499001996007) internal successors, (1478), 1007 states have internal predecessors, (1478), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:36:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1505 transitions. [2025-02-06 08:36:16,019 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1505 transitions. Word has length 67 [2025-02-06 08:36:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:16,020 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1505 transitions. [2025-02-06 08:36:16,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1505 transitions. [2025-02-06 08:36:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 08:36:16,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:16,023 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:36:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:36:16,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 735833518, now seen corresponding path program 1 times [2025-02-06 08:36:16,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:16,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707044949] [2025-02-06 08:36:16,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:16,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 08:36:16,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 08:36:16,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:16,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:16,628 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:36:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:16,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707044949] [2025-02-06 08:36:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707044949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:36:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495558325] [2025-02-06 08:36:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:16,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:36:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:16,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:36:16,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:36:16,630 INFO L87 Difference]: Start difference. First operand 1020 states and 1505 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:17,065 INFO L93 Difference]: Finished difference Result 2416 states and 3561 transitions. [2025-02-06 08:36:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:36:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-06 08:36:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:17,070 INFO L225 Difference]: With dead ends: 2416 [2025-02-06 08:36:17,070 INFO L226 Difference]: Without dead ends: 1400 [2025-02-06 08:36:17,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:36:17,072 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 542 mSDsluCounter, 4505 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 5887 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:17,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 5887 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:36:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-02-06 08:36:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1023. [2025-02-06 08:36:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:36:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2025-02-06 08:36:17,093 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 143 [2025-02-06 08:36:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:17,093 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2025-02-06 08:36:17,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2025-02-06 08:36:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-06 08:36:17,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:17,099 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:17,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:36:17,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1937157855, now seen corresponding path program 1 times [2025-02-06 08:36:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:17,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428090812] [2025-02-06 08:36:17,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:17,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 08:36:17,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 08:36:17,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:17,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:17,455 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:36:17,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428090812] [2025-02-06 08:36:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428090812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:17,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:17,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:36:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602802988] [2025-02-06 08:36:17,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:17,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:36:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:17,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:36:17,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:36:17,459 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:17,693 INFO L93 Difference]: Finished difference Result 1997 states and 2943 transitions. [2025-02-06 08:36:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:36:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-02-06 08:36:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:17,697 INFO L225 Difference]: With dead ends: 1997 [2025-02-06 08:36:17,697 INFO L226 Difference]: Without dead ends: 981 [2025-02-06 08:36:17,699 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:36:17,700 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 30 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:17,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3854 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:36:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-02-06 08:36:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-02-06 08:36:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 963 states have (on average 1.4579439252336448) internal successors, (1404), 968 states have internal predecessors, (1404), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:36:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1431 transitions. [2025-02-06 08:36:17,728 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1431 transitions. Word has length 213 [2025-02-06 08:36:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:17,729 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1431 transitions. [2025-02-06 08:36:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1431 transitions. [2025-02-06 08:36:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-06 08:36:17,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:17,731 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:17,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:36:17,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1762469240, now seen corresponding path program 1 times [2025-02-06 08:36:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079436176] [2025-02-06 08:36:17,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:17,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 08:36:17,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 08:36:17,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:17,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:17,947 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:36:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079436176] [2025-02-06 08:36:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079436176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:17,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:17,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:36:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560968902] [2025-02-06 08:36:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:17,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:36:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:17,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:36:17,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:36:17,950 INFO L87 Difference]: Start difference. First operand 981 states and 1431 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:18,204 INFO L93 Difference]: Finished difference Result 2482 states and 3634 transitions. [2025-02-06 08:36:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:36:18,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-02-06 08:36:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:18,212 INFO L225 Difference]: With dead ends: 2482 [2025-02-06 08:36:18,212 INFO L226 Difference]: Without dead ends: 1508 [2025-02-06 08:36:18,213 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:36:18,215 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 713 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:18,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2596 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:36:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-06 08:36:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1350. [2025-02-06 08:36:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1330 states have (on average 1.4609022556390978) internal successors, (1943), 1335 states have internal predecessors, (1943), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:36:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1974 transitions. [2025-02-06 08:36:18,251 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1974 transitions. Word has length 213 [2025-02-06 08:36:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:18,252 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1974 transitions. [2025-02-06 08:36:18,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:36:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1974 transitions. [2025-02-06 08:36:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-06 08:36:18,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:18,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:18,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:36:18,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 702606055, now seen corresponding path program 1 times [2025-02-06 08:36:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202764342] [2025-02-06 08:36:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:18,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-06 08:36:18,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-06 08:36:18,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:18,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:18,625 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:36:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202764342] [2025-02-06 08:36:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202764342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:18,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:18,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:36:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442027899] [2025-02-06 08:36:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:18,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:36:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:18,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:36:18,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:36:18,629 INFO L87 Difference]: Start difference. First operand 1350 states and 1974 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:36:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:19,028 INFO L93 Difference]: Finished difference Result 2567 states and 3760 transitions. [2025-02-06 08:36:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:36:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2025-02-06 08:36:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:19,036 INFO L225 Difference]: With dead ends: 2567 [2025-02-06 08:36:19,036 INFO L226 Difference]: Without dead ends: 1308 [2025-02-06 08:36:19,038 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:36:19,039 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 30 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:19,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3632 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:36:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-02-06 08:36:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2025-02-06 08:36:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1288 states have (on average 1.4487577639751552) internal successors, (1866), 1293 states have internal predecessors, (1866), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:36:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1897 transitions. [2025-02-06 08:36:19,091 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1897 transitions. Word has length 228 [2025-02-06 08:36:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:19,091 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1897 transitions. [2025-02-06 08:36:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:36:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1897 transitions. [2025-02-06 08:36:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-06 08:36:19,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:19,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:36:19,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:19,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1726861376, now seen corresponding path program 1 times [2025-02-06 08:36:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712681907] [2025-02-06 08:36:19,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:19,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-06 08:36:19,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-06 08:36:19,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:19,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:19,345 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:36:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712681907] [2025-02-06 08:36:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712681907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:19,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:36:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187958946] [2025-02-06 08:36:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:19,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:36:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:19,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:36:19,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:36:19,347 INFO L87 Difference]: Start difference. First operand 1308 states and 1897 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:36:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:19,607 INFO L93 Difference]: Finished difference Result 3091 states and 4501 transitions. [2025-02-06 08:36:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:36:19,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2025-02-06 08:36:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:19,614 INFO L225 Difference]: With dead ends: 3091 [2025-02-06 08:36:19,614 INFO L226 Difference]: Without dead ends: 1874 [2025-02-06 08:36:19,615 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:36:19,615 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 593 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:19,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2624 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:36:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-02-06 08:36:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1869. [2025-02-06 08:36:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1843 states have (on average 1.4519804666304938) internal successors, (2676), 1848 states have internal predecessors, (2676), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:36:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2719 transitions. [2025-02-06 08:36:19,651 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2719 transitions. Word has length 228 [2025-02-06 08:36:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:19,652 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2719 transitions. [2025-02-06 08:36:19,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:36:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2719 transitions. [2025-02-06 08:36:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-06 08:36:19,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:19,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:36:19,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1244212725, now seen corresponding path program 1 times [2025-02-06 08:36:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:19,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899429488] [2025-02-06 08:36:19,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:19,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-06 08:36:19,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-06 08:36:19,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:19,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899429488] [2025-02-06 08:36:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899429488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:36:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740258517] [2025-02-06 08:36:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:19,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:36:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:36:19,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:36:19,937 INFO L87 Difference]: Start difference. First operand 1869 states and 2719 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 08:36:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:20,441 INFO L93 Difference]: Finished difference Result 3077 states and 4483 transitions. [2025-02-06 08:36:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:36:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 243 [2025-02-06 08:36:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:20,446 INFO L225 Difference]: With dead ends: 3077 [2025-02-06 08:36:20,446 INFO L226 Difference]: Without dead ends: 1443 [2025-02-06 08:36:20,448 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:36:20,448 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 2357 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:20,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 1446 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:36:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-02-06 08:36:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2025-02-06 08:36:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1422 states have (on average 1.4374120956399437) internal successors, (2044), 1427 states have internal predecessors, (2044), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:36:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2077 transitions. [2025-02-06 08:36:20,476 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2077 transitions. Word has length 243 [2025-02-06 08:36:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:20,476 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2077 transitions. [2025-02-06 08:36:20,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 08:36:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2077 transitions. [2025-02-06 08:36:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:36:20,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:20,479 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:20,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:36:20,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:20,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1568102073, now seen corresponding path program 1 times [2025-02-06 08:36:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:20,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465453717] [2025-02-06 08:36:20,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:20,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:36:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:36:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 08:36:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465453717] [2025-02-06 08:36:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465453717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:36:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437123211] [2025-02-06 08:36:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:36:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:20,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:36:20,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:36:20,746 INFO L87 Difference]: Start difference. First operand 1443 states and 2077 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:20,932 INFO L93 Difference]: Finished difference Result 2322 states and 3385 transitions. [2025-02-06 08:36:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:36:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 253 [2025-02-06 08:36:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:20,938 INFO L225 Difference]: With dead ends: 2322 [2025-02-06 08:36:20,938 INFO L226 Difference]: Without dead ends: 1463 [2025-02-06 08:36:20,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:36:20,940 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 8 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:20,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2411 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:36:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-02-06 08:36:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2025-02-06 08:36:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1442 states have (on average 1.4313453536754508) internal successors, (2064), 1447 states have internal predecessors, (2064), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:36:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2097 transitions. [2025-02-06 08:36:20,993 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2097 transitions. Word has length 253 [2025-02-06 08:36:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:20,994 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2097 transitions. [2025-02-06 08:36:20,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2097 transitions. [2025-02-06 08:36:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:36:20,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:20,998 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:36:20,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 239745448, now seen corresponding path program 1 times [2025-02-06 08:36:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638000285] [2025-02-06 08:36:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:21,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:36:21,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:36:21,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 08:36:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638000285] [2025-02-06 08:36:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638000285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:21,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:36:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054866302] [2025-02-06 08:36:21,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:21,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:36:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:36:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:36:21,351 INFO L87 Difference]: Start difference. First operand 1463 states and 2097 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:21,648 INFO L93 Difference]: Finished difference Result 2332 states and 3388 transitions. [2025-02-06 08:36:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:36:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 253 [2025-02-06 08:36:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:21,654 INFO L225 Difference]: With dead ends: 2332 [2025-02-06 08:36:21,654 INFO L226 Difference]: Without dead ends: 1401 [2025-02-06 08:36:21,656 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:36:21,656 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 32 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:21,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3400 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:36:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-02-06 08:36:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-02-06 08:36:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1380 states have (on average 1.4231884057971014) internal successors, (1964), 1385 states have internal predecessors, (1964), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:36:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1997 transitions. [2025-02-06 08:36:21,689 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1997 transitions. Word has length 253 [2025-02-06 08:36:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1997 transitions. [2025-02-06 08:36:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1997 transitions. [2025-02-06 08:36:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:36:21,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:21,692 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:36:21,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1146198271, now seen corresponding path program 1 times [2025-02-06 08:36:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914157685] [2025-02-06 08:36:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:21,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:36:21,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:36:21,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:21,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914157685] [2025-02-06 08:36:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914157685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:36:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844092583] [2025-02-06 08:36:22,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:22,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:36:22,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:36:22,562 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:36:22,566 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:36:22,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:36:23,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:36:23,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:23,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:23,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 08:36:23,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:36:23,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:36:23,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:36:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:23,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:36:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844092583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:23,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:36:23,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-06 08:36:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145540874] [2025-02-06 08:36:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:23,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:36:23,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:23,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:36:23,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:36:23,536 INFO L87 Difference]: Start difference. First operand 1401 states and 1997 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:27,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:36:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:28,162 INFO L93 Difference]: Finished difference Result 2595 states and 3714 transitions. [2025-02-06 08:36:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:36:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 253 [2025-02-06 08:36:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:28,170 INFO L225 Difference]: With dead ends: 2595 [2025-02-06 08:36:28,170 INFO L226 Difference]: Without dead ends: 1722 [2025-02-06 08:36:28,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 242 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:36:28,174 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 1262 mSDsluCounter, 3629 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 4728 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:28,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 4728 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 728 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 08:36:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-02-06 08:36:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1570. [2025-02-06 08:36:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1539 states have (on average 1.4152046783625731) internal successors, (2178), 1548 states have internal predecessors, (2178), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 08:36:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2225 transitions. [2025-02-06 08:36:28,239 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2225 transitions. Word has length 253 [2025-02-06 08:36:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:28,240 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2225 transitions. [2025-02-06 08:36:28,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2225 transitions. [2025-02-06 08:36:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 08:36:28,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:28,245 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:36:28,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:36:28,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 08:36:28,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:28,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1427636099, now seen corresponding path program 1 times [2025-02-06 08:36:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555708316] [2025-02-06 08:36:28,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:28,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 08:36:28,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 08:36:28,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:28,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555708316] [2025-02-06 08:36:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555708316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:36:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306784497] [2025-02-06 08:36:29,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:29,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:36:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:36:29,563 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:36:29,568 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:36:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 08:36:30,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 08:36:30,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:30,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:30,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:36:30,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:36:30,189 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 15 treesize of output 1 [2025-02-06 08:36:30,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:36:30,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:36:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:30,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:36:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:30,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306784497] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:36:30,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:36:30,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-02-06 08:36:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203487916] [2025-02-06 08:36:30,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:36:30,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:36:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:30,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:36:30,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:36:30,883 INFO L87 Difference]: Start difference. First operand 1570 states and 2225 transitions. Second operand has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:36:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:31,966 INFO L93 Difference]: Finished difference Result 3837 states and 5391 transitions. [2025-02-06 08:36:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 08:36:31,967 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 329 [2025-02-06 08:36:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:31,974 INFO L225 Difference]: With dead ends: 3837 [2025-02-06 08:36:31,975 INFO L226 Difference]: Without dead ends: 2502 [2025-02-06 08:36:31,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 647 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:36:31,977 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 2268 mSDsluCounter, 7025 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 8152 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:31,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 8152 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:36:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2025-02-06 08:36:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2218. [2025-02-06 08:36:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2175 states have (on average 1.3912643678160919) internal successors, (3026), 2184 states have internal predecessors, (3026), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 08:36:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3095 transitions. [2025-02-06 08:36:32,026 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3095 transitions. Word has length 329 [2025-02-06 08:36:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:32,027 INFO L471 AbstractCegarLoop]: Abstraction has 2218 states and 3095 transitions. [2025-02-06 08:36:32,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:36:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3095 transitions. [2025-02-06 08:36:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2025-02-06 08:36:32,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:32,037 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:32,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:36:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:36:32,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:32,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1889135409, now seen corresponding path program 1 times [2025-02-06 08:36:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122971017] [2025-02-06 08:36:32,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:32,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-02-06 08:36:32,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-02-06 08:36:32,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:32,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122971017] [2025-02-06 08:36:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122971017] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:36:36,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439115944] [2025-02-06 08:36:36,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:36,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:36:36,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:36:36,675 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:36:36,677 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:36:37,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-02-06 08:36:37,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-02-06 08:36:37,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:37,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:37,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:36:37,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:36:37,686 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 15 treesize of output 1 [2025-02-06 08:36:37,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:36:38,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:36:38,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:36:38,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:36:38,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:36:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:38,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:36:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:36:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439115944] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:36:39,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:36:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-02-06 08:36:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494301482] [2025-02-06 08:36:39,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:36:39,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 08:36:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:39,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 08:36:39,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:36:39,155 INFO L87 Difference]: Start difference. First operand 2218 states and 3095 transitions. Second operand has 21 states, 21 states have (on average 64.85714285714286) internal successors, (1362), 21 states have internal predecessors, (1362), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:36:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:40,400 INFO L93 Difference]: Finished difference Result 5571 states and 7734 transitions. [2025-02-06 08:36:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 08:36:40,401 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.85714285714286) internal successors, (1362), 21 states have internal predecessors, (1362), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 767 [2025-02-06 08:36:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:40,414 INFO L225 Difference]: With dead ends: 5571 [2025-02-06 08:36:40,414 INFO L226 Difference]: Without dead ends: 4236 [2025-02-06 08:36:40,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1557 GetRequests, 1521 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-02-06 08:36:40,418 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 6225 mSDsluCounter, 8969 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6267 SdHoareTripleChecker+Valid, 10096 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:40,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6267 Valid, 10096 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:36:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2025-02-06 08:36:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 3952. [2025-02-06 08:36:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3885 states have (on average 1.3688545688545688) internal successors, (5318), 3894 states have internal predecessors, (5318), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:36:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5435 transitions. [2025-02-06 08:36:40,523 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5435 transitions. Word has length 767 [2025-02-06 08:36:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:40,525 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5435 transitions. [2025-02-06 08:36:40,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.85714285714286) internal successors, (1362), 21 states have internal predecessors, (1362), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:36:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5435 transitions. [2025-02-06 08:36:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-06 08:36:40,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:40,579 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,600 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:36:40,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:36:40,781 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:40,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash -652007181, now seen corresponding path program 2 times [2025-02-06 08:36:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294145994] [2025-02-06 08:36:40,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:36:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:41,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1643 statements into 2 equivalence classes. [2025-02-06 08:36:41,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1643 statements. [2025-02-06 08:36:41,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:36:41,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:36:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294145994] [2025-02-06 08:36:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294145994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:41,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:41,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:36:41,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955125607] [2025-02-06 08:36:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:36:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:41,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:36:41,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:36:41,442 INFO L87 Difference]: Start difference. First operand 3952 states and 5435 transitions. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:42,572 INFO L93 Difference]: Finished difference Result 4814 states and 6717 transitions. [2025-02-06 08:36:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:36:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1643 [2025-02-06 08:36:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:42,583 INFO L225 Difference]: With dead ends: 4814 [2025-02-06 08:36:42,583 INFO L226 Difference]: Without dead ends: 3963 [2025-02-06 08:36:42,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:36:42,585 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 45 mSDsluCounter, 6457 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 7601 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:42,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 7601 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:36:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2025-02-06 08:36:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3959. [2025-02-06 08:36:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3892 states have (on average 1.3681911613566289) internal successors, (5325), 3901 states have internal predecessors, (5325), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:36:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5442 transitions. [2025-02-06 08:36:42,656 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5442 transitions. Word has length 1643 [2025-02-06 08:36:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:42,658 INFO L471 AbstractCegarLoop]: Abstraction has 3959 states and 5442 transitions. [2025-02-06 08:36:42,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5442 transitions. [2025-02-06 08:36:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-06 08:36:42,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:42,674 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:36:42,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:42,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1021860006, now seen corresponding path program 1 times [2025-02-06 08:36:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034817741] [2025-02-06 08:36:42,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:43,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-06 08:36:43,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-06 08:36:43,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:43,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:36:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034817741] [2025-02-06 08:36:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034817741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:36:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083327799] [2025-02-06 08:36:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:47,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:36:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:47,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:36:47,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:36:47,787 INFO L87 Difference]: Start difference. First operand 3959 states and 5442 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:48,369 INFO L93 Difference]: Finished difference Result 4814 states and 6712 transitions. [2025-02-06 08:36:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:36:48,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-06 08:36:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:48,397 INFO L225 Difference]: With dead ends: 4814 [2025-02-06 08:36:48,406 INFO L226 Difference]: Without dead ends: 3964 [2025-02-06 08:36:48,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:36:48,409 INFO L435 NwaCegarLoop]: 1150 mSDtfsCounter, 21 mSDsluCounter, 4326 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:48,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5476 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:36:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-02-06 08:36:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3963. [2025-02-06 08:36:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3896 states have (on average 1.3680698151950719) internal successors, (5330), 3905 states have internal predecessors, (5330), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:36:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5447 transitions. [2025-02-06 08:36:48,516 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5447 transitions. Word has length 1644 [2025-02-06 08:36:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:48,517 INFO L471 AbstractCegarLoop]: Abstraction has 3963 states and 5447 transitions. [2025-02-06 08:36:48,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5447 transitions. [2025-02-06 08:36:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-06 08:36:48,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:48,547 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:36:48,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:48,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash -693689889, now seen corresponding path program 1 times [2025-02-06 08:36:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107490131] [2025-02-06 08:36:48,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:49,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-06 08:36:49,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-06 08:36:49,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:49,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:36:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107490131] [2025-02-06 08:36:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107490131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:36:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824860991] [2025-02-06 08:36:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:52,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:36:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:52,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:36:52,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:36:52,111 INFO L87 Difference]: Start difference. First operand 3963 states and 5447 transitions. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:52,675 INFO L93 Difference]: Finished difference Result 4812 states and 6708 transitions. [2025-02-06 08:36:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:36:52,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-06 08:36:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:52,684 INFO L225 Difference]: With dead ends: 4812 [2025-02-06 08:36:52,684 INFO L226 Difference]: Without dead ends: 3971 [2025-02-06 08:36:52,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:36:52,686 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 21 mSDsluCounter, 6487 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7631 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:52,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7631 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:36:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2025-02-06 08:36:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3963. [2025-02-06 08:36:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3896 states have (on average 1.3680698151950719) internal successors, (5330), 3905 states have internal predecessors, (5330), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:36:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5447 transitions. [2025-02-06 08:36:52,741 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5447 transitions. Word has length 1644 [2025-02-06 08:36:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:52,741 INFO L471 AbstractCegarLoop]: Abstraction has 3963 states and 5447 transitions. [2025-02-06 08:36:52,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5447 transitions. [2025-02-06 08:36:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-06 08:36:52,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:52,756 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:36:52,756 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:52,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash -270303942, now seen corresponding path program 1 times [2025-02-06 08:36:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9746158] [2025-02-06 08:36:52,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:53,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-06 08:36:53,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-06 08:36:53,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:53,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:36:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:36:56,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:36:56,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9746158] [2025-02-06 08:36:56,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9746158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:36:56,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:36:56,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:36:56,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183902082] [2025-02-06 08:36:56,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:36:56,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:36:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:36:56,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:36:56,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:36:56,687 INFO L87 Difference]: Start difference. First operand 3963 states and 5447 transitions. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:36:57,371 INFO L93 Difference]: Finished difference Result 4820 states and 6719 transitions. [2025-02-06 08:36:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:36:57,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1645 [2025-02-06 08:36:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:36:57,378 INFO L225 Difference]: With dead ends: 4820 [2025-02-06 08:36:57,378 INFO L226 Difference]: Without dead ends: 3974 [2025-02-06 08:36:57,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:36:57,380 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 31 mSDsluCounter, 7659 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8806 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:36:57,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8806 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:36:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2025-02-06 08:36:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3971. [2025-02-06 08:36:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3904 states have (on average 1.367827868852459) internal successors, (5340), 3913 states have internal predecessors, (5340), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:36:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5457 transitions. [2025-02-06 08:36:57,425 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5457 transitions. Word has length 1645 [2025-02-06 08:36:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:36:57,426 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 5457 transitions. [2025-02-06 08:36:57,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:36:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5457 transitions. [2025-02-06 08:36:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2025-02-06 08:36:57,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:36:57,441 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:57,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:36:57,441 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:36:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:36:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1977601757, now seen corresponding path program 1 times [2025-02-06 08:36:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:36:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213932264] [2025-02-06 08:36:57,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:36:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:36:57,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1646 statements into 1 equivalence classes. [2025-02-06 08:36:58,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1646 of 1646 statements. [2025-02-06 08:36:58,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:36:58,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:37:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:37:00,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:37:00,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213932264] [2025-02-06 08:37:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213932264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:37:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:37:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:37:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769192091] [2025-02-06 08:37:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:37:00,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:37:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:37:00,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:37:00,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:37:00,726 INFO L87 Difference]: Start difference. First operand 3971 states and 5457 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:37:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:37:01,232 INFO L93 Difference]: Finished difference Result 4826 states and 6727 transitions. [2025-02-06 08:37:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:37:01,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1646 [2025-02-06 08:37:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:37:01,241 INFO L225 Difference]: With dead ends: 4826 [2025-02-06 08:37:01,241 INFO L226 Difference]: Without dead ends: 3974 [2025-02-06 08:37:01,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:37:01,243 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 16 mSDsluCounter, 4341 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:37:01,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5494 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:37:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2025-02-06 08:37:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3974. [2025-02-06 08:37:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3907 states have (on average 1.3675454312771949) internal successors, (5343), 3916 states have internal predecessors, (5343), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:37:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5460 transitions. [2025-02-06 08:37:01,325 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5460 transitions. Word has length 1646 [2025-02-06 08:37:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:37:01,326 INFO L471 AbstractCegarLoop]: Abstraction has 3974 states and 5460 transitions. [2025-02-06 08:37:01,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:37:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5460 transitions. [2025-02-06 08:37:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2025-02-06 08:37:01,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:37:01,355 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:01,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:37:01,355 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:37:01,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:37:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1833192061, now seen corresponding path program 1 times [2025-02-06 08:37:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:37:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853283133] [2025-02-06 08:37:01,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:37:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:37:01,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1646 statements into 1 equivalence classes. [2025-02-06 08:37:02,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1646 of 1646 statements. [2025-02-06 08:37:02,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:37:02,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:37:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 1988 proven. 75 refuted. 0 times theorem prover too weak. 5275 trivial. 0 not checked. [2025-02-06 08:37:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:37:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853283133] [2025-02-06 08:37:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853283133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:37:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746923511] [2025-02-06 08:37:06,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:37:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:37:06,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:37:06,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:37:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:37:08,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1646 statements into 1 equivalence classes. [2025-02-06 08:37:09,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1646 of 1646 statements. [2025-02-06 08:37:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:37:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:37:09,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 8006 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 08:37:09,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:37:09,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:09,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:09,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:10,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:11,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:37:11,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:37:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 42 proven. 7272 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:37:11,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:37:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 42 proven. 7272 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:37:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746923511] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:37:12,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:37:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-02-06 08:37:12,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082326096] [2025-02-06 08:37:12,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:37:12,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 08:37:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:37:12,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 08:37:12,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 08:37:12,880 INFO L87 Difference]: Start difference. First operand 3974 states and 5460 transitions. Second operand has 34 states, 34 states have (on average 98.44117647058823) internal successors, (3347), 34 states have internal predecessors, (3347), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:37:17,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:37:18,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:37:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:37:20,970 INFO L93 Difference]: Finished difference Result 8231 states and 11325 transitions. [2025-02-06 08:37:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-02-06 08:37:20,972 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 98.44117647058823) internal successors, (3347), 34 states have internal predecessors, (3347), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1646 [2025-02-06 08:37:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:37:20,991 INFO L225 Difference]: With dead ends: 8231 [2025-02-06 08:37:20,992 INFO L226 Difference]: Without dead ends: 7320 [2025-02-06 08:37:20,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3347 GetRequests, 3261 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-02-06 08:37:20,998 INFO L435 NwaCegarLoop]: 1094 mSDtfsCounter, 10377 mSDsluCounter, 10843 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 71 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10449 SdHoareTripleChecker+Valid, 11937 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:37:20,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10449 Valid, 11937 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1739 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-02-06 08:37:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2025-02-06 08:37:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7318. [2025-02-06 08:37:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7318 states, 7185 states have (on average 1.3529575504523312) internal successors, (9721), 7194 states have internal predecessors, (9721), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 08:37:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 9970 transitions. [2025-02-06 08:37:21,115 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 9970 transitions. Word has length 1646 [2025-02-06 08:37:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:37:21,116 INFO L471 AbstractCegarLoop]: Abstraction has 7318 states and 9970 transitions. [2025-02-06 08:37:21,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 98.44117647058823) internal successors, (3347), 34 states have internal predecessors, (3347), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:37:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 9970 transitions. [2025-02-06 08:37:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3319 [2025-02-06 08:37:21,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:37:21,167 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 08:37:21,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:37:21,368 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:37:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:37:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash 253984981, now seen corresponding path program 2 times [2025-02-06 08:37:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:37:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444106883] [2025-02-06 08:37:21,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:37:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:37:22,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3318 statements into 2 equivalence classes. [2025-02-06 08:37:22,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 3318 statements. [2025-02-06 08:37:22,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:37:22,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:37:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 43286 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43286 trivial. 0 not checked. [2025-02-06 08:37:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:37:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444106883] [2025-02-06 08:37:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444106883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:37:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:37:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 08:37:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704739303] [2025-02-06 08:37:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:37:22,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:37:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:37:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:37:22,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:37:22,542 INFO L87 Difference]: Start difference. First operand 7318 states and 9970 transitions. Second operand has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:37:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:37:23,817 INFO L93 Difference]: Finished difference Result 8189 states and 11260 transitions. [2025-02-06 08:37:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 08:37:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3318 [2025-02-06 08:37:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:37:23,834 INFO L225 Difference]: With dead ends: 8189 [2025-02-06 08:37:23,834 INFO L226 Difference]: Without dead ends: 7363 [2025-02-06 08:37:23,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:37:23,840 INFO L435 NwaCegarLoop]: 1154 mSDtfsCounter, 102 mSDsluCounter, 11128 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 12282 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:37:23,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 12282 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 08:37:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7363 states. [2025-02-06 08:37:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7363 to 7324. [2025-02-06 08:37:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 7191 states have (on average 1.3529411764705883) internal successors, (9729), 7200 states have internal predecessors, (9729), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 08:37:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 9978 transitions. [2025-02-06 08:37:23,957 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 9978 transitions. Word has length 3318 [2025-02-06 08:37:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:37:23,959 INFO L471 AbstractCegarLoop]: Abstraction has 7324 states and 9978 transitions. [2025-02-06 08:37:23,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:37:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 9978 transitions. [2025-02-06 08:37:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3320 [2025-02-06 08:37:24,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:37:24,009 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:24,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:37:24,009 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:37:24,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:37:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -475117307, now seen corresponding path program 1 times [2025-02-06 08:37:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:37:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905399735] [2025-02-06 08:37:24,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:37:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:37:24,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3319 statements into 1 equivalence classes. [2025-02-06 08:37:26,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3319 of 3319 statements. [2025-02-06 08:37:26,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:37:26,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat