./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:49:07,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:49:08,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:49:08,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:49:08,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:49:08,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:49:08,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:49:08,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:49:08,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:49:08,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:49:08,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:49:08,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:49:08,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:49:08,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:49:08,044 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:49:08,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:49:08,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:49:08,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:49:08,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:49:08,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:49:08,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:49:08,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:49:08,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:49:08,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:49:08,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:49:08,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:49:08,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:49:08,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:49:08,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:49:08,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:49:08,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:49:08,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:49:08,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:49:08,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:49:08,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-02-08 04:49:08,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:49:08,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:49:08,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:49:08,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:49:08,320 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:49:08,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2025-02-08 04:49:09,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b75a1833a/e55069b5cffb4611a049b8d6e11944c0/FLAG4ab887118 [2025-02-08 04:49:09,981 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:49:09,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2025-02-08 04:49:10,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b75a1833a/e55069b5cffb4611a049b8d6e11944c0/FLAG4ab887118 [2025-02-08 04:49:10,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b75a1833a/e55069b5cffb4611a049b8d6e11944c0 [2025-02-08 04:49:10,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:49:10,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:49:10,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:49:10,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:49:10,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:49:10,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2c4a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10, skipping insertion in model container [2025-02-08 04:49:10,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:49:10,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i[33519,33532] [2025-02-08 04:49:10,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:49:10,572 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:49:10,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i[33519,33532] [2025-02-08 04:49:10,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:49:10,695 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:49:10,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10 WrapperNode [2025-02-08 04:49:10,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:49:10,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:49:10,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:49:10,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:49:10,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,796 INFO L138 Inliner]: procedures = 177, calls = 273, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1386 [2025-02-08 04:49:10,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:49:10,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:49:10,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:49:10,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:49:10,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,897 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-08 04:49:10,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:49:10,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:49:10,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:49:10,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:49:10,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (1/1) ... [2025-02-08 04:49:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:49:10,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:11,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 04:49:11,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:49:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:49:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:49:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:49:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:49:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:49:11,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:49:11,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:49:11,247 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:49:11,249 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:49:12,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:49:12,634 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2025-02-08 04:49:12,634 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:49:12,689 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:49:12,690 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:49:12,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:49:12 BoogieIcfgContainer [2025-02-08 04:49:12,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:49:12,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:49:12,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:49:12,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:49:12,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:49:10" (1/3) ... [2025-02-08 04:49:12,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f3b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:49:12, skipping insertion in model container [2025-02-08 04:49:12,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:49:10" (2/3) ... [2025-02-08 04:49:12,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f3b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:49:12, skipping insertion in model container [2025-02-08 04:49:12,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:49:12" (3/3) ... [2025-02-08 04:49:12,698 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2025-02-08 04:49:12,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:49:12,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test3-1.i that has 5 procedures, 404 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-02-08 04:49:12,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:49:12,821 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;@5d5843cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:49:12,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:49:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 387 states have (on average 1.6175710594315245) internal successors, (626), 389 states have internal predecessors, (626), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:49:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 04:49:12,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:12,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:12,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 866567231, now seen corresponding path program 1 times [2025-02-08 04:49:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069698482] [2025-02-08 04:49:12,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:12,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 04:49:12,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 04:49:12,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:12,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:13,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069698482] [2025-02-08 04:49:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069698482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:49:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150984798] [2025-02-08 04:49:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:13,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:49:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:13,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:49:13,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:49:13,032 INFO L87 Difference]: Start difference. First operand has 396 states, 387 states have (on average 1.6175710594315245) internal successors, (626), 389 states have internal predecessors, (626), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:13,156 INFO L93 Difference]: Finished difference Result 790 states and 1271 transitions. [2025-02-08 04:49:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:49:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 04:49:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:13,170 INFO L225 Difference]: With dead ends: 790 [2025-02-08 04:49:13,171 INFO L226 Difference]: Without dead ends: 393 [2025-02-08 04:49:13,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:49:13,182 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:13,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:49:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-08 04:49:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-02-08 04:49:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 385 states have (on average 1.4519480519480519) internal successors, (559), 386 states have internal predecessors, (559), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:49:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 569 transitions. [2025-02-08 04:49:13,258 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 569 transitions. Word has length 11 [2025-02-08 04:49:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:13,258 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 569 transitions. [2025-02-08 04:49:13,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 569 transitions. [2025-02-08 04:49:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 04:49:13,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:13,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:13,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:49:13,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:13,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1720072209, now seen corresponding path program 1 times [2025-02-08 04:49:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:13,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820441431] [2025-02-08 04:49:13,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:13,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 04:49:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 04:49:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820441431] [2025-02-08 04:49:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820441431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:13,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:49:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007744274] [2025-02-08 04:49:13,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:13,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:13,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:13,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:13,528 INFO L87 Difference]: Start difference. First operand 393 states and 569 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:13,989 INFO L93 Difference]: Finished difference Result 1078 states and 1578 transitions. [2025-02-08 04:49:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:49:13,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 04:49:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:13,994 INFO L225 Difference]: With dead ends: 1078 [2025-02-08 04:49:13,994 INFO L226 Difference]: Without dead ends: 685 [2025-02-08 04:49:13,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:13,996 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 428 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:13,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1501 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-08 04:49:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 684. [2025-02-08 04:49:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 675 states have (on average 1.471111111111111) internal successors, (993), 677 states have internal predecessors, (993), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:49:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1005 transitions. [2025-02-08 04:49:14,053 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1005 transitions. Word has length 13 [2025-02-08 04:49:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:14,053 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1005 transitions. [2025-02-08 04:49:14,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1005 transitions. [2025-02-08 04:49:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 04:49:14,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:14,056 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] [2025-02-08 04:49:14,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:49:14,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -376230999, now seen corresponding path program 1 times [2025-02-08 04:49:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255610086] [2025-02-08 04:49:14,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 04:49:14,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 04:49:14,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:14,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:14,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:14,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255610086] [2025-02-08 04:49:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255610086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:14,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:49:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639389199] [2025-02-08 04:49:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:14,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:14,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:14,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:14,373 INFO L87 Difference]: Start difference. First operand 684 states and 1005 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:14,565 INFO L93 Difference]: Finished difference Result 953 states and 1392 transitions. [2025-02-08 04:49:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:49:14,566 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 04:49:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:14,569 INFO L225 Difference]: With dead ends: 953 [2025-02-08 04:49:14,569 INFO L226 Difference]: Without dead ends: 600 [2025-02-08 04:49:14,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:14,573 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 30 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:14,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-08 04:49:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-08 04:49:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 591 states have (on average 1.4196277495769882) internal successors, (839), 593 states have internal predecessors, (839), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:49:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 851 transitions. [2025-02-08 04:49:14,609 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 851 transitions. Word has length 66 [2025-02-08 04:49:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:14,610 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 851 transitions. [2025-02-08 04:49:14,611 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 851 transitions. [2025-02-08 04:49:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 04:49:14,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:14,615 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] [2025-02-08 04:49:14,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:49:14,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:14,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash -661438032, now seen corresponding path program 1 times [2025-02-08 04:49:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:14,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855607686] [2025-02-08 04:49:14,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:14,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 04:49:14,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 04:49:14,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:14,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:49:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855607686] [2025-02-08 04:49:15,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855607686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:15,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:15,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:49:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363538712] [2025-02-08 04:49:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:15,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:15,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:49:15,227 INFO L87 Difference]: Start difference. First operand 600 states and 851 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:15,507 INFO L93 Difference]: Finished difference Result 1109 states and 1542 transitions. [2025-02-08 04:49:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:49:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 04:49:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:15,514 INFO L225 Difference]: With dead ends: 1109 [2025-02-08 04:49:15,514 INFO L226 Difference]: Without dead ends: 837 [2025-02-08 04:49:15,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:15,516 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 461 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:15,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1751 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-02-08 04:49:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 599. [2025-02-08 04:49:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 590 states have (on average 1.4186440677966101) internal successors, (837), 592 states have internal predecessors, (837), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:49:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 849 transitions. [2025-02-08 04:49:15,573 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 849 transitions. Word has length 66 [2025-02-08 04:49:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:15,574 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 849 transitions. [2025-02-08 04:49:15,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:49:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 849 transitions. [2025-02-08 04:49:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 04:49:15,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:15,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:49:15,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1549070682, now seen corresponding path program 1 times [2025-02-08 04:49:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101007302] [2025-02-08 04:49:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:15,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 04:49:15,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 04:49:15,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:15,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:15,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:15,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101007302] [2025-02-08 04:49:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101007302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:49:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255435938] [2025-02-08 04:49:15,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:15,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:15,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:49:15,828 INFO L87 Difference]: Start difference. First operand 599 states and 849 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:15,972 INFO L93 Difference]: Finished difference Result 1145 states and 1616 transitions. [2025-02-08 04:49:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:49:15,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 04:49:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:15,976 INFO L225 Difference]: With dead ends: 1145 [2025-02-08 04:49:15,976 INFO L226 Difference]: Without dead ends: 605 [2025-02-08 04:49:15,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:15,978 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 105 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:15,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1194 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:49:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-08 04:49:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2025-02-08 04:49:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 590 states have (on average 1.3949152542372882) internal successors, (823), 592 states have internal predecessors, (823), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:49:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 835 transitions. [2025-02-08 04:49:15,996 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 835 transitions. Word has length 103 [2025-02-08 04:49:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:15,997 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 835 transitions. [2025-02-08 04:49:15,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 835 transitions. [2025-02-08 04:49:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 04:49:15,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:15,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:15,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:49:15,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:15,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1617212895, now seen corresponding path program 1 times [2025-02-08 04:49:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:15,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651298243] [2025-02-08 04:49:16,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:16,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:16,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 04:49:16,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 04:49:16,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:16,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:16,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651298243] [2025-02-08 04:49:16,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651298243] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:16,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618765306] [2025-02-08 04:49:16,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:16,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:16,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:16,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:16,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:49:16,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 04:49:16,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 04:49:16,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:16,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:16,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 04:49:16,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:16,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:49:16,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-08 04:49:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:17,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618765306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:17,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:17,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 04:49:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094806189] [2025-02-08 04:49:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:17,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:49:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:17,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:49:17,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:49:17,874 INFO L87 Difference]: Start difference. First operand 599 states and 835 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:20,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 04:49:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:21,151 INFO L93 Difference]: Finished difference Result 1399 states and 1936 transitions. [2025-02-08 04:49:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:49:21,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 04:49:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:21,155 INFO L225 Difference]: With dead ends: 1399 [2025-02-08 04:49:21,155 INFO L226 Difference]: Without dead ends: 885 [2025-02-08 04:49:21,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:49:21,158 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 727 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:21,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 2412 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 04:49:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-08 04:49:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 624. [2025-02-08 04:49:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 615 states have (on average 1.3869918699186992) internal successors, (853), 617 states have internal predecessors, (853), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:49:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 865 transitions. [2025-02-08 04:49:21,186 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 865 transitions. Word has length 103 [2025-02-08 04:49:21,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:21,188 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 865 transitions. [2025-02-08 04:49:21,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 865 transitions. [2025-02-08 04:49:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 04:49:21,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:21,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:21,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:21,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:21,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:21,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash -847156218, now seen corresponding path program 1 times [2025-02-08 04:49:21,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:21,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161187912] [2025-02-08 04:49:21,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:21,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 04:49:21,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 04:49:21,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:21,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161187912] [2025-02-08 04:49:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161187912] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755304086] [2025-02-08 04:49:21,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:21,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:21,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:49:22,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 04:49:22,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 04:49:22,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:22,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:22,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 04:49:22,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:49:22,214 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 7 treesize of output 3 [2025-02-08 04:49:22,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:49:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:22,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:49:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755304086] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 04:49:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 11 [2025-02-08 04:49:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627903558] [2025-02-08 04:49:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:49:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:22,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:49:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 04:49:22,722 INFO L87 Difference]: Start difference. First operand 624 states and 865 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:22,923 INFO L93 Difference]: Finished difference Result 807 states and 1113 transitions. [2025-02-08 04:49:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:49:22,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-08 04:49:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:22,931 INFO L225 Difference]: With dead ends: 807 [2025-02-08 04:49:22,931 INFO L226 Difference]: Without dead ends: 797 [2025-02-08 04:49:22,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:22,933 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 739 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:22,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1274 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-02-08 04:49:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 626. [2025-02-08 04:49:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 617 states have (on average 1.385737439222042) internal successors, (855), 619 states have internal predecessors, (855), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:49:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 867 transitions. [2025-02-08 04:49:22,961 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 867 transitions. Word has length 104 [2025-02-08 04:49:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 867 transitions. [2025-02-08 04:49:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 867 transitions. [2025-02-08 04:49:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-08 04:49:22,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:22,965 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] [2025-02-08 04:49:22,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:23,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -821945125, now seen corresponding path program 1 times [2025-02-08 04:49:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434321343] [2025-02-08 04:49:23,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:23,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 04:49:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 04:49:23,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:23,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434321343] [2025-02-08 04:49:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434321343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 04:49:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549639739] [2025-02-08 04:49:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:49:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:23,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:49:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:23,453 INFO L87 Difference]: Start difference. First operand 626 states and 867 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:23,909 INFO L93 Difference]: Finished difference Result 1437 states and 1981 transitions. [2025-02-08 04:49:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:49:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2025-02-08 04:49:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:23,914 INFO L225 Difference]: With dead ends: 1437 [2025-02-08 04:49:23,914 INFO L226 Difference]: Without dead ends: 968 [2025-02-08 04:49:23,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:23,915 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1473 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:23,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1306 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-02-08 04:49:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 765. [2025-02-08 04:49:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 755 states have (on average 1.3814569536423842) internal successors, (1043), 758 states have internal predecessors, (1043), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1057 transitions. [2025-02-08 04:49:23,942 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1057 transitions. Word has length 157 [2025-02-08 04:49:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:23,943 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1057 transitions. [2025-02-08 04:49:23,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1057 transitions. [2025-02-08 04:49:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:49:23,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:23,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:23,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:49:23,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:23,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1285509769, now seen corresponding path program 1 times [2025-02-08 04:49:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171842270] [2025-02-08 04:49:23,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:23,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:23,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:49:24,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:49:24,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:24,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171842270] [2025-02-08 04:49:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171842270] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646602526] [2025-02-08 04:49:24,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:24,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:24,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:24,394 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-08 04:49:24,398 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-08 04:49:24,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:49:24,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:49:24,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:24,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:24,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 04:49:24,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:24,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646602526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 04:49:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937099789] [2025-02-08 04:49:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:24,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:24,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:24,849 INFO L87 Difference]: Start difference. First operand 765 states and 1057 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:25,123 INFO L93 Difference]: Finished difference Result 1463 states and 2023 transitions. [2025-02-08 04:49:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:49:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 04:49:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:25,127 INFO L225 Difference]: With dead ends: 1463 [2025-02-08 04:49:25,127 INFO L226 Difference]: Without dead ends: 808 [2025-02-08 04:49:25,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:25,128 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 17 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:25,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1148 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-08 04:49:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 792. [2025-02-08 04:49:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 782 states have (on average 1.3759590792838874) internal successors, (1076), 785 states have internal predecessors, (1076), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1090 transitions. [2025-02-08 04:49:25,155 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1090 transitions. Word has length 167 [2025-02-08 04:49:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1090 transitions. [2025-02-08 04:49:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1090 transitions. [2025-02-08 04:49:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 04:49:25,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:25,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:25,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:25,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:25,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:25,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:25,359 INFO L85 PathProgramCache]: Analyzing trace with hash -259980623, now seen corresponding path program 1 times [2025-02-08 04:49:25,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:25,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498478720] [2025-02-08 04:49:25,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:25,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:25,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 04:49:25,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 04:49:25,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:25,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498478720] [2025-02-08 04:49:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498478720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:25,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:25,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:49:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75057933] [2025-02-08 04:49:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:25,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:49:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:25,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:49:25,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:25,767 INFO L87 Difference]: Start difference. First operand 792 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:26,208 INFO L93 Difference]: Finished difference Result 1482 states and 2042 transitions. [2025-02-08 04:49:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:49:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-08 04:49:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:26,212 INFO L225 Difference]: With dead ends: 1482 [2025-02-08 04:49:26,212 INFO L226 Difference]: Without dead ends: 804 [2025-02-08 04:49:26,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:26,213 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 8 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:26,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1422 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-02-08 04:49:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 800. [2025-02-08 04:49:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 790 states have (on average 1.3746835443037975) internal successors, (1086), 793 states have internal predecessors, (1086), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1100 transitions. [2025-02-08 04:49:26,243 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1100 transitions. Word has length 168 [2025-02-08 04:49:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:26,243 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1100 transitions. [2025-02-08 04:49:26,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1100 transitions. [2025-02-08 04:49:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 04:49:26,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:26,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:49:26,246 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:26,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 8529229, now seen corresponding path program 1 times [2025-02-08 04:49:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131806508] [2025-02-08 04:49:26,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:26,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 04:49:26,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 04:49:26,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:26,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:26,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131806508] [2025-02-08 04:49:26,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131806508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:26,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:26,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:49:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164617599] [2025-02-08 04:49:26,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:26,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:26,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:26,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:26,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:49:26,637 INFO L87 Difference]: Start difference. First operand 800 states and 1100 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:27,249 INFO L93 Difference]: Finished difference Result 1497 states and 2062 transitions. [2025-02-08 04:49:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:27,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-02-08 04:49:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:27,255 INFO L225 Difference]: With dead ends: 1497 [2025-02-08 04:49:27,255 INFO L226 Difference]: Without dead ends: 822 [2025-02-08 04:49:27,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:49:27,256 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 12 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:27,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2027 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:49:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-08 04:49:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 816. [2025-02-08 04:49:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 806 states have (on average 1.3746898263027296) internal successors, (1108), 809 states have internal predecessors, (1108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1122 transitions. [2025-02-08 04:49:27,288 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1122 transitions. Word has length 169 [2025-02-08 04:49:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1122 transitions. [2025-02-08 04:49:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1122 transitions. [2025-02-08 04:49:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 04:49:27,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:27,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:27,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:49:27,290 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:27,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -955855617, now seen corresponding path program 1 times [2025-02-08 04:49:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553273641] [2025-02-08 04:49:27,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:27,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 04:49:27,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 04:49:27,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:27,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553273641] [2025-02-08 04:49:27,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553273641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712611307] [2025-02-08 04:49:27,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:27,734 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-08 04:49:27,736 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-08 04:49:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 04:49:28,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 04:49:28,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:28,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 04:49:28,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:28,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:49:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:28,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:28,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712611307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:28,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:28,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-08 04:49:28,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478518058] [2025-02-08 04:49:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:28,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:49:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:28,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:49:28,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:28,737 INFO L87 Difference]: Start difference. First operand 816 states and 1122 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:29,919 INFO L93 Difference]: Finished difference Result 1454 states and 1983 transitions. [2025-02-08 04:49:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:49:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-02-08 04:49:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:29,924 INFO L225 Difference]: With dead ends: 1454 [2025-02-08 04:49:29,924 INFO L226 Difference]: Without dead ends: 1046 [2025-02-08 04:49:29,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-08 04:49:29,926 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 468 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:29,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2575 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:49:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-08 04:49:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 850. [2025-02-08 04:49:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 840 states have (on average 1.3642857142857143) internal successors, (1146), 843 states have internal predecessors, (1146), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1160 transitions. [2025-02-08 04:49:29,959 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1160 transitions. Word has length 169 [2025-02-08 04:49:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:29,959 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1160 transitions. [2025-02-08 04:49:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1160 transitions. [2025-02-08 04:49:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 04:49:29,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:29,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:29,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:30,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 04:49:30,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1167988452, now seen corresponding path program 1 times [2025-02-08 04:49:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547631977] [2025-02-08 04:49:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:30,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:49:30,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:49:30,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:30,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547631977] [2025-02-08 04:49:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547631977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281760690] [2025-02-08 04:49:30,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:30,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:30,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:30,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:30,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 04:49:30,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 04:49:30,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 04:49:30,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:30,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:30,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 04:49:30,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:31,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281760690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:31,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:31,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-02-08 04:49:31,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437752391] [2025-02-08 04:49:31,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:31,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:49:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:31,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:49:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:49:31,051 INFO L87 Difference]: Start difference. First operand 850 states and 1160 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:31,438 INFO L93 Difference]: Finished difference Result 1264 states and 1724 transitions. [2025-02-08 04:49:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:49:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-02-08 04:49:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:31,444 INFO L225 Difference]: With dead ends: 1264 [2025-02-08 04:49:31,444 INFO L226 Difference]: Without dead ends: 856 [2025-02-08 04:49:31,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:49:31,446 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 34 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:31,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1864 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-02-08 04:49:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 850. [2025-02-08 04:49:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 840 states have (on average 1.3607142857142858) internal successors, (1143), 843 states have internal predecessors, (1143), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1157 transitions. [2025-02-08 04:49:31,475 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1157 transitions. Word has length 170 [2025-02-08 04:49:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:31,477 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1157 transitions. [2025-02-08 04:49:31,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1157 transitions. [2025-02-08 04:49:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 04:49:31,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:31,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:31,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:31,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 04:49:31,680 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:31,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1867294780, now seen corresponding path program 1 times [2025-02-08 04:49:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:31,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946681158] [2025-02-08 04:49:31,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:31,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 04:49:31,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 04:49:31,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:31,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946681158] [2025-02-08 04:49:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946681158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:32,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:32,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:49:32,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842466093] [2025-02-08 04:49:32,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:32,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:49:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:32,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:49:32,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:32,029 INFO L87 Difference]: Start difference. First operand 850 states and 1157 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:32,319 INFO L93 Difference]: Finished difference Result 1267 states and 1725 transitions. [2025-02-08 04:49:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:49:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-02-08 04:49:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:32,324 INFO L225 Difference]: With dead ends: 1267 [2025-02-08 04:49:32,324 INFO L226 Difference]: Without dead ends: 859 [2025-02-08 04:49:32,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:49:32,325 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 8 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:32,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1570 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:49:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-08 04:49:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-02-08 04:49:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 849 states have (on average 1.3568904593639577) internal successors, (1152), 852 states have internal predecessors, (1152), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1166 transitions. [2025-02-08 04:49:32,355 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1166 transitions. Word has length 171 [2025-02-08 04:49:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:32,356 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1166 transitions. [2025-02-08 04:49:32,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1166 transitions. [2025-02-08 04:49:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 04:49:32,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:32,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:32,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:49:32,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1849636392, now seen corresponding path program 1 times [2025-02-08 04:49:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:32,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751383390] [2025-02-08 04:49:32,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:32,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:49:32,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:49:32,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:32,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:32,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751383390] [2025-02-08 04:49:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751383390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:32,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:32,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:49:32,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438032065] [2025-02-08 04:49:32,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:32,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:32,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:32,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:49:32,731 INFO L87 Difference]: Start difference. First operand 859 states and 1166 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:33,090 INFO L93 Difference]: Finished difference Result 1291 states and 1752 transitions. [2025-02-08 04:49:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-02-08 04:49:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:33,096 INFO L225 Difference]: With dead ends: 1291 [2025-02-08 04:49:33,096 INFO L226 Difference]: Without dead ends: 874 [2025-02-08 04:49:33,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:49:33,098 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 12 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:33,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2282 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:49:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-08 04:49:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 871. [2025-02-08 04:49:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 861 states have (on average 1.3554006968641115) internal successors, (1167), 864 states have internal predecessors, (1167), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1181 transitions. [2025-02-08 04:49:33,125 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1181 transitions. Word has length 172 [2025-02-08 04:49:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:33,126 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1181 transitions. [2025-02-08 04:49:33,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1181 transitions. [2025-02-08 04:49:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 04:49:33,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:33,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:33,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 04:49:33,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:33,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:33,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1087761076, now seen corresponding path program 1 times [2025-02-08 04:49:33,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:33,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615805521] [2025-02-08 04:49:33,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:33,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:49:33,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:49:33,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:33,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615805521] [2025-02-08 04:49:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615805521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293800280] [2025-02-08 04:49:33,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:33,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:33,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:33,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:33,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 04:49:33,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 04:49:33,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 04:49:33,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:33,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:33,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 04:49:33,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:34,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:34,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293800280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:34,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:34,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:49:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931521893] [2025-02-08 04:49:34,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:34,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:34,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:34,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:34,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:34,192 INFO L87 Difference]: Start difference. First operand 871 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:34,660 INFO L93 Difference]: Finished difference Result 1315 states and 1782 transitions. [2025-02-08 04:49:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-02-08 04:49:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:34,664 INFO L225 Difference]: With dead ends: 1315 [2025-02-08 04:49:34,665 INFO L226 Difference]: Without dead ends: 886 [2025-02-08 04:49:34,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:34,666 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 12 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:34,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2288 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-08 04:49:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 871. [2025-02-08 04:49:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 861 states have (on average 1.3554006968641115) internal successors, (1167), 864 states have internal predecessors, (1167), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1181 transitions. [2025-02-08 04:49:34,697 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1181 transitions. Word has length 172 [2025-02-08 04:49:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:34,698 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1181 transitions. [2025-02-08 04:49:34,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1181 transitions. [2025-02-08 04:49:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 04:49:34,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:34,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:34,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:34,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 04:49:34,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:34,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -813338027, now seen corresponding path program 1 times [2025-02-08 04:49:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941474017] [2025-02-08 04:49:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:34,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 04:49:34,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 04:49:34,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:35,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:35,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941474017] [2025-02-08 04:49:35,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941474017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:49:35,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227991912] [2025-02-08 04:49:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:49:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:49:35,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:35,303 INFO L87 Difference]: Start difference. First operand 871 states and 1181 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:35,806 INFO L93 Difference]: Finished difference Result 1330 states and 1800 transitions. [2025-02-08 04:49:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:49:35,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-02-08 04:49:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:35,812 INFO L225 Difference]: With dead ends: 1330 [2025-02-08 04:49:35,812 INFO L226 Difference]: Without dead ends: 901 [2025-02-08 04:49:35,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:35,813 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 20 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:35,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2726 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:49:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-02-08 04:49:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 892. [2025-02-08 04:49:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 882 states have (on average 1.3537414965986394) internal successors, (1194), 885 states have internal predecessors, (1194), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1208 transitions. [2025-02-08 04:49:35,841 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1208 transitions. Word has length 173 [2025-02-08 04:49:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:35,841 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1208 transitions. [2025-02-08 04:49:35,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1208 transitions. [2025-02-08 04:49:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 04:49:35,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:35,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:35,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 04:49:35,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:35,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1329960289, now seen corresponding path program 1 times [2025-02-08 04:49:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635291883] [2025-02-08 04:49:35,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:35,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 04:49:35,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 04:49:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:36,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635291883] [2025-02-08 04:49:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635291883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670290040] [2025-02-08 04:49:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:36,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:36,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 04:49:36,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 04:49:36,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 04:49:36,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:36,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:36,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:49:36,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:36,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670290040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:36,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-02-08 04:49:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300113779] [2025-02-08 04:49:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:49:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:36,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:49:36,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 04:49:36,784 INFO L87 Difference]: Start difference. First operand 892 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:37,170 INFO L93 Difference]: Finished difference Result 1380 states and 1862 transitions. [2025-02-08 04:49:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:49:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-02-08 04:49:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:37,175 INFO L225 Difference]: With dead ends: 1380 [2025-02-08 04:49:37,175 INFO L226 Difference]: Without dead ends: 930 [2025-02-08 04:49:37,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:37,176 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 40 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:37,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2691 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:49:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-08 04:49:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 907. [2025-02-08 04:49:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 897 states have (on average 1.351170568561873) internal successors, (1212), 900 states have internal predecessors, (1212), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1226 transitions. [2025-02-08 04:49:37,206 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1226 transitions. Word has length 173 [2025-02-08 04:49:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:37,207 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1226 transitions. [2025-02-08 04:49:37,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1226 transitions. [2025-02-08 04:49:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-08 04:49:37,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:37,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:37,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:37,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:37,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1765884497, now seen corresponding path program 1 times [2025-02-08 04:49:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758726516] [2025-02-08 04:49:37,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:37,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 04:49:37,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 04:49:37,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:37,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:37,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758726516] [2025-02-08 04:49:37,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758726516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:37,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:37,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 04:49:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039813646] [2025-02-08 04:49:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:37,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:49:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:37,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:49:37,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 04:49:37,929 INFO L87 Difference]: Start difference. First operand 907 states and 1226 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:38,531 INFO L93 Difference]: Finished difference Result 1399 states and 1890 transitions. [2025-02-08 04:49:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:49:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-02-08 04:49:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:38,535 INFO L225 Difference]: With dead ends: 1399 [2025-02-08 04:49:38,536 INFO L226 Difference]: Without dead ends: 934 [2025-02-08 04:49:38,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:38,537 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 23 mSDsluCounter, 3025 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3459 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:38,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3459 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:49:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-08 04:49:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 916. [2025-02-08 04:49:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 906 states have (on average 1.3476821192052981) internal successors, (1221), 909 states have internal predecessors, (1221), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1235 transitions. [2025-02-08 04:49:38,564 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1235 transitions. Word has length 174 [2025-02-08 04:49:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:38,565 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1235 transitions. [2025-02-08 04:49:38,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1235 transitions. [2025-02-08 04:49:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-08 04:49:38,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:38,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:38,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 04:49:38,568 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:38,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash -907747415, now seen corresponding path program 1 times [2025-02-08 04:49:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:38,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619245240] [2025-02-08 04:49:38,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:38,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 04:49:38,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 04:49:38,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:38,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:38,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619245240] [2025-02-08 04:49:38,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619245240] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:38,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961255211] [2025-02-08 04:49:38,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:38,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:38,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 04:49:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 04:49:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 04:49:39,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:39,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:39,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 04:49:39,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:39,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961255211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:39,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:49:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87079974] [2025-02-08 04:49:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:39,546 INFO L87 Difference]: Start difference. First operand 916 states and 1235 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:40,064 INFO L93 Difference]: Finished difference Result 1713 states and 2309 transitions. [2025-02-08 04:49:40,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:40,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-02-08 04:49:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:40,067 INFO L225 Difference]: With dead ends: 1713 [2025-02-08 04:49:40,067 INFO L226 Difference]: Without dead ends: 930 [2025-02-08 04:49:40,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:40,069 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 12 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:40,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2027 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:49:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-02-08 04:49:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 916. [2025-02-08 04:49:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 906 states have (on average 1.3476821192052981) internal successors, (1221), 909 states have internal predecessors, (1221), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1235 transitions. [2025-02-08 04:49:40,098 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1235 transitions. Word has length 174 [2025-02-08 04:49:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:40,099 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1235 transitions. [2025-02-08 04:49:40,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1235 transitions. [2025-02-08 04:49:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-08 04:49:40,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:40,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:40,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:40,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:40,303 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1896812464, now seen corresponding path program 1 times [2025-02-08 04:49:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90484030] [2025-02-08 04:49:40,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:40,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 04:49:40,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 04:49:40,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:40,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90484030] [2025-02-08 04:49:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90484030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:49:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173887586] [2025-02-08 04:49:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:40,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:49:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:40,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:49:40,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:40,669 INFO L87 Difference]: Start difference. First operand 916 states and 1235 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:41,216 INFO L93 Difference]: Finished difference Result 1720 states and 2315 transitions. [2025-02-08 04:49:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:49:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-02-08 04:49:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:41,221 INFO L225 Difference]: With dead ends: 1720 [2025-02-08 04:49:41,221 INFO L226 Difference]: Without dead ends: 942 [2025-02-08 04:49:41,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:41,223 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 20 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:41,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2160 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:49:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-02-08 04:49:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 930. [2025-02-08 04:49:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 920 states have (on average 1.3467391304347827) internal successors, (1239), 923 states have internal predecessors, (1239), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1253 transitions. [2025-02-08 04:49:41,254 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1253 transitions. Word has length 175 [2025-02-08 04:49:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:41,255 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1253 transitions. [2025-02-08 04:49:41,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1253 transitions. [2025-02-08 04:49:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-08 04:49:41,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:41,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:41,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 04:49:41,259 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:41,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1529973378, now seen corresponding path program 1 times [2025-02-08 04:49:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:41,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501869887] [2025-02-08 04:49:41,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:41,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 04:49:41,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 04:49:41,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:41,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501869887] [2025-02-08 04:49:41,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501869887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054430166] [2025-02-08 04:49:41,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:41,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:41,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 04:49:41,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 04:49:42,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 04:49:42,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:42,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 04:49:42,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:42,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054430166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:42,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:49:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303614317] [2025-02-08 04:49:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:42,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:42,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:42,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:42,137 INFO L87 Difference]: Start difference. First operand 930 states and 1253 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:42,561 INFO L93 Difference]: Finished difference Result 1739 states and 2344 transitions. [2025-02-08 04:49:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-02-08 04:49:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:42,565 INFO L225 Difference]: With dead ends: 1739 [2025-02-08 04:49:42,565 INFO L226 Difference]: Without dead ends: 954 [2025-02-08 04:49:42,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:42,567 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 17 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:42,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2050 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:49:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-02-08 04:49:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 944. [2025-02-08 04:49:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 934 states have (on average 1.34796573875803) internal successors, (1259), 937 states have internal predecessors, (1259), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1273 transitions. [2025-02-08 04:49:42,594 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1273 transitions. Word has length 175 [2025-02-08 04:49:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:42,594 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1273 transitions. [2025-02-08 04:49:42,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1273 transitions. [2025-02-08 04:49:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 04:49:42,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:42,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:42,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:42,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:42,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -235009132, now seen corresponding path program 1 times [2025-02-08 04:49:42,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828992710] [2025-02-08 04:49:42,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:42,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:42,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:42,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:42,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828992710] [2025-02-08 04:49:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828992710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:43,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:43,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 04:49:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685162029] [2025-02-08 04:49:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:49:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:43,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:49:43,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 04:49:43,238 INFO L87 Difference]: Start difference. First operand 944 states and 1273 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:43,950 INFO L93 Difference]: Finished difference Result 1759 states and 2370 transitions. [2025-02-08 04:49:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:49:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-02-08 04:49:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:43,953 INFO L225 Difference]: With dead ends: 1759 [2025-02-08 04:49:43,954 INFO L226 Difference]: Without dead ends: 962 [2025-02-08 04:49:43,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:43,955 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 23 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:43,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3041 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 04:49:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-02-08 04:49:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 950. [2025-02-08 04:49:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 940 states have (on average 1.3457446808510638) internal successors, (1265), 943 states have internal predecessors, (1265), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1279 transitions. [2025-02-08 04:49:44,017 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1279 transitions. Word has length 176 [2025-02-08 04:49:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:44,017 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1279 transitions. [2025-02-08 04:49:44,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1279 transitions. [2025-02-08 04:49:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 04:49:44,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:44,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 04:49:44,023 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1502452090, now seen corresponding path program 1 times [2025-02-08 04:49:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470769256] [2025-02-08 04:49:44,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:44,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:44,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:44,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:44,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470769256] [2025-02-08 04:49:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470769256] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701550073] [2025-02-08 04:49:44,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:44,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:44,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:44,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 04:49:44,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:44,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:44,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:44,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:44,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:49:44,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:45,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701550073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:49:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816447116] [2025-02-08 04:49:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:45,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:45,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:45,065 INFO L87 Difference]: Start difference. First operand 950 states and 1279 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:45,437 INFO L93 Difference]: Finished difference Result 1439 states and 1934 transitions. [2025-02-08 04:49:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:45,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-02-08 04:49:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:45,442 INFO L225 Difference]: With dead ends: 1439 [2025-02-08 04:49:45,442 INFO L226 Difference]: Without dead ends: 965 [2025-02-08 04:49:45,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:45,444 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 10 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:45,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2288 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:49:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-02-08 04:49:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 950. [2025-02-08 04:49:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 940 states have (on average 1.3457446808510638) internal successors, (1265), 943 states have internal predecessors, (1265), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1279 transitions. [2025-02-08 04:49:45,481 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1279 transitions. Word has length 176 [2025-02-08 04:49:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:45,482 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1279 transitions. [2025-02-08 04:49:45,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1279 transitions. [2025-02-08 04:49:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 04:49:45,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:45,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:45,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 04:49:45,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 04:49:45,685 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:45,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2051629634, now seen corresponding path program 1 times [2025-02-08 04:49:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157420294] [2025-02-08 04:49:45,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:45,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:45,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:45,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:45,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:45,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157420294] [2025-02-08 04:49:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157420294] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873508171] [2025-02-08 04:49:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:46,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:46,076 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:46,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 04:49:46,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:46,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:46,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:46,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:46,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 04:49:46,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 04:49:46,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873508171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:46,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:46,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 04:49:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662226967] [2025-02-08 04:49:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:46,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:46,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:46,638 INFO L87 Difference]: Start difference. First operand 950 states and 1279 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:46,913 INFO L93 Difference]: Finished difference Result 1447 states and 1942 transitions. [2025-02-08 04:49:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 04:49:46,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-02-08 04:49:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:46,917 INFO L225 Difference]: With dead ends: 1447 [2025-02-08 04:49:46,917 INFO L226 Difference]: Without dead ends: 973 [2025-02-08 04:49:46,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 04:49:46,919 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 39 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:46,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2294 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-02-08 04:49:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 941. [2025-02-08 04:49:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 931 states have (on average 1.3458646616541354) internal successors, (1253), 934 states have internal predecessors, (1253), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 04:49:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1267 transitions. [2025-02-08 04:49:46,935 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1267 transitions. Word has length 176 [2025-02-08 04:49:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:46,936 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1267 transitions. [2025-02-08 04:49:46,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1267 transitions. [2025-02-08 04:49:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 04:49:46,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:46,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:46,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 04:49:47,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 04:49:47,138 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:47,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1106049118, now seen corresponding path program 1 times [2025-02-08 04:49:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13537125] [2025-02-08 04:49:47,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:47,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:47,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:47,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:47,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13537125] [2025-02-08 04:49:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13537125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869089517] [2025-02-08 04:49:47,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:47,415 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:47,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 04:49:47,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 04:49:48,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 04:49:48,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:48,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 04:49:48,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:48,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869089517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:48,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:48,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 04:49:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200369213] [2025-02-08 04:49:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:48,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:49:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:48,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:49:48,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:48,083 INFO L87 Difference]: Start difference. First operand 941 states and 1267 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:48,175 INFO L93 Difference]: Finished difference Result 1695 states and 2276 transitions. [2025-02-08 04:49:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:49:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-02-08 04:49:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:48,181 INFO L225 Difference]: With dead ends: 1695 [2025-02-08 04:49:48,181 INFO L226 Difference]: Without dead ends: 944 [2025-02-08 04:49:48,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:49:48,183 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:48,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1322 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:49:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-08 04:49:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2025-02-08 04:49:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 933 states have (on average 1.3461950696677385) internal successors, (1256), 937 states have internal predecessors, (1256), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:49:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1271 transitions. [2025-02-08 04:49:48,209 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1271 transitions. Word has length 176 [2025-02-08 04:49:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:48,210 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1271 transitions. [2025-02-08 04:49:48,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1271 transitions. [2025-02-08 04:49:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-08 04:49:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:48,212 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 04:49:48,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:48,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:48,413 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:48,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1943280550, now seen corresponding path program 1 times [2025-02-08 04:49:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470422755] [2025-02-08 04:49:48,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:48,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 04:49:48,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 04:49:48,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:48,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 04:49:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470422755] [2025-02-08 04:49:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470422755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107333857] [2025-02-08 04:49:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:48,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:48,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:48,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:48,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 04:49:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 04:49:49,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 04:49:49,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:49,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:49,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 04:49:49,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:49:49,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:49:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 04:49:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107333857] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:49:49,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:49:49,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 04:49:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149682534] [2025-02-08 04:49:49,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:49:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:49:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:49,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:49:49,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:49,421 INFO L87 Difference]: Start difference. First operand 944 states and 1271 transitions. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:49:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:49,570 INFO L93 Difference]: Finished difference Result 1709 states and 2297 transitions. [2025-02-08 04:49:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:49:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 178 [2025-02-08 04:49:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:49,574 INFO L225 Difference]: With dead ends: 1709 [2025-02-08 04:49:49,574 INFO L226 Difference]: Without dead ends: 955 [2025-02-08 04:49:49,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:49,575 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 4 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:49,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2199 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:49:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-02-08 04:49:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2025-02-08 04:49:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 941 states have (on average 1.3496280552603612) internal successors, (1270), 945 states have internal predecessors, (1270), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:49:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1285 transitions. [2025-02-08 04:49:49,596 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1285 transitions. Word has length 178 [2025-02-08 04:49:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:49,596 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1285 transitions. [2025-02-08 04:49:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:49:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1285 transitions. [2025-02-08 04:49:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:49:49,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:49,598 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:49:49,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 04:49:49,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:49,799 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:49,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash 879293858, now seen corresponding path program 2 times [2025-02-08 04:49:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797406028] [2025-02-08 04:49:49,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:49:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:49,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-02-08 04:49:49,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 182 statements. [2025-02-08 04:49:49,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:49:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 04:49:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797406028] [2025-02-08 04:49:50,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797406028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:50,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:50,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:49:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356073672] [2025-02-08 04:49:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:49:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:50,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:49:50,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:49:50,184 INFO L87 Difference]: Start difference. First operand 953 states and 1285 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:50,692 INFO L93 Difference]: Finished difference Result 1466 states and 1970 transitions. [2025-02-08 04:49:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:49:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 182 [2025-02-08 04:49:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:50,696 INFO L225 Difference]: With dead ends: 1466 [2025-02-08 04:49:50,696 INFO L226 Difference]: Without dead ends: 1001 [2025-02-08 04:49:50,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:49:50,698 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 23 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:50,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2746 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:49:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-02-08 04:49:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 971. [2025-02-08 04:49:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 959 states have (on average 1.3461939520333681) internal successors, (1291), 963 states have internal predecessors, (1291), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:49:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1306 transitions. [2025-02-08 04:49:50,727 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1306 transitions. Word has length 182 [2025-02-08 04:49:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1306 transitions. [2025-02-08 04:49:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1306 transitions. [2025-02-08 04:49:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 04:49:50,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:50,729 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-02-08 04:49:50,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 04:49:50,729 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1948325211, now seen corresponding path program 1 times [2025-02-08 04:49:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:50,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576232919] [2025-02-08 04:49:50,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:49:50,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:49:50,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:50,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576232919] [2025-02-08 04:49:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576232919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879088272] [2025-02-08 04:49:51,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:51,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:51,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:51,277 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:51,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 04:49:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:49:51,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:49:51,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:51,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:51,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:49:51,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 04:49:52,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:49:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879088272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:49:52,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-08 04:49:52,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523660709] [2025-02-08 04:49:52,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:49:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:52,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:49:52,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:49:52,110 INFO L87 Difference]: Start difference. First operand 971 states and 1306 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:52,686 INFO L93 Difference]: Finished difference Result 1802 states and 2423 transitions. [2025-02-08 04:49:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:49:52,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 183 [2025-02-08 04:49:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:52,691 INFO L225 Difference]: With dead ends: 1802 [2025-02-08 04:49:52,691 INFO L226 Difference]: Without dead ends: 981 [2025-02-08 04:49:52,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:49:52,693 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 10 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:52,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2027 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:49:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-02-08 04:49:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 971. [2025-02-08 04:49:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 959 states have (on average 1.3461939520333681) internal successors, (1291), 963 states have internal predecessors, (1291), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:49:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1306 transitions. [2025-02-08 04:49:52,726 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1306 transitions. Word has length 183 [2025-02-08 04:49:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:52,726 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1306 transitions. [2025-02-08 04:49:52,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1306 transitions. [2025-02-08 04:49:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 04:49:52,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:52,728 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-02-08 04:49:52,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:52,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 04:49:52,928 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1562997569, now seen corresponding path program 1 times [2025-02-08 04:49:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723349548] [2025-02-08 04:49:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:52,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:49:53,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:49:53,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:53,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:49:53,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:53,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723349548] [2025-02-08 04:49:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723349548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:53,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76719077] [2025-02-08 04:49:53,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:53,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:53,484 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:53,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 04:49:53,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:49:54,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:49:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:54,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 04:49:54,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 04:49:54,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:49:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 04:49:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76719077] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:49:54,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:49:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 6] total 18 [2025-02-08 04:49:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641785426] [2025-02-08 04:49:54,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:49:54,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 04:49:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:54,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 04:49:54,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-02-08 04:49:54,287 INFO L87 Difference]: Start difference. First operand 971 states and 1306 transitions. Second operand has 18 states, 18 states have (on average 10.722222222222221) internal successors, (193), 18 states have internal predecessors, (193), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 04:49:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:54,598 INFO L93 Difference]: Finished difference Result 1727 states and 2313 transitions. [2025-02-08 04:49:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 04:49:54,599 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.722222222222221) internal successors, (193), 18 states have internal predecessors, (193), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 183 [2025-02-08 04:49:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:54,603 INFO L225 Difference]: With dead ends: 1727 [2025-02-08 04:49:54,603 INFO L226 Difference]: Without dead ends: 814 [2025-02-08 04:49:54,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-02-08 04:49:54,605 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 31 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:54,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2166 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:49:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-08 04:49:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 810. [2025-02-08 04:49:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 798 states have (on average 1.3157894736842106) internal successors, (1050), 802 states have internal predecessors, (1050), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:49:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1065 transitions. [2025-02-08 04:49:54,637 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1065 transitions. Word has length 183 [2025-02-08 04:49:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:54,637 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1065 transitions. [2025-02-08 04:49:54,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.722222222222221) internal successors, (193), 18 states have internal predecessors, (193), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 04:49:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1065 transitions. [2025-02-08 04:49:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-08 04:49:54,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:54,639 INFO L218 NwaCegarLoop]: trace histogram [13, 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] [2025-02-08 04:49:54,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 04:49:54,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:54,840 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:54,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1599910573, now seen corresponding path program 2 times [2025-02-08 04:49:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794696278] [2025-02-08 04:49:54,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:49:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:54,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-02-08 04:49:54,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 82 of 190 statements. [2025-02-08 04:49:54,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:49:54,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-08 04:49:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794696278] [2025-02-08 04:49:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794696278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:49:55,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:49:55,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 04:49:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544881643] [2025-02-08 04:49:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:49:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 04:49:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:49:55,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 04:49:55,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:49:55,198 INFO L87 Difference]: Start difference. First operand 810 states and 1065 transitions. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:49:55,898 INFO L93 Difference]: Finished difference Result 1389 states and 1849 transitions. [2025-02-08 04:49:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 04:49:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 190 [2025-02-08 04:49:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:49:55,906 INFO L225 Difference]: With dead ends: 1389 [2025-02-08 04:49:55,906 INFO L226 Difference]: Without dead ends: 906 [2025-02-08 04:49:55,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-08 04:49:55,907 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 52 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:49:55,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 3148 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:49:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-02-08 04:49:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 822. [2025-02-08 04:49:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.3148148148148149) internal successors, (1065), 814 states have internal predecessors, (1065), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:49:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1080 transitions. [2025-02-08 04:49:55,939 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1080 transitions. Word has length 190 [2025-02-08 04:49:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:49:55,940 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1080 transitions. [2025-02-08 04:49:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:49:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1080 transitions. [2025-02-08 04:49:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-08 04:49:55,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:49:55,942 INFO L218 NwaCegarLoop]: trace histogram [13, 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] [2025-02-08 04:49:55,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 04:49:55,942 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:49:55,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:49:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1177592812, now seen corresponding path program 1 times [2025-02-08 04:49:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:49:55,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355355020] [2025-02-08 04:49:55,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:49:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 04:49:56,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 04:49:56,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:56,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 04:49:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:49:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355355020] [2025-02-08 04:49:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355355020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:49:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292196011] [2025-02-08 04:49:56,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:49:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:49:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:49:56,534 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:49:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 04:49:56,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 04:49:57,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 04:49:57,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:49:57,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:49:57,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 04:49:57,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:49:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 59 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 04:49:57,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:50:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 70 refuted. 1 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 04:50:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292196011] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:50:02,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:50:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-08 04:50:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483984849] [2025-02-08 04:50:02,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:50:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 04:50:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:02,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 04:50:02,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=324, Unknown=1, NotChecked=0, Total=462 [2025-02-08 04:50:02,004 INFO L87 Difference]: Start difference. First operand 822 states and 1080 transitions. Second operand has 22 states, 22 states have (on average 8.954545454545455) internal successors, (197), 22 states have internal predecessors, (197), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 04:50:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:02,622 INFO L93 Difference]: Finished difference Result 1544 states and 2032 transitions. [2025-02-08 04:50:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 04:50:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.954545454545455) internal successors, (197), 22 states have internal predecessors, (197), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2025-02-08 04:50:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:02,627 INFO L225 Difference]: With dead ends: 1544 [2025-02-08 04:50:02,627 INFO L226 Difference]: Without dead ends: 831 [2025-02-08 04:50:02,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=346, Invalid=709, Unknown=1, NotChecked=0, Total=1056 [2025-02-08 04:50:02,629 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 8 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:02,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2991 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:50:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-02-08 04:50:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 829. [2025-02-08 04:50:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 817 states have (on average 1.3108935128518973) internal successors, (1071), 821 states have internal predecessors, (1071), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:50:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1086 transitions. [2025-02-08 04:50:02,662 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1086 transitions. Word has length 190 [2025-02-08 04:50:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:02,662 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1086 transitions. [2025-02-08 04:50:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.954545454545455) internal successors, (197), 22 states have internal predecessors, (197), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 04:50:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1086 transitions. [2025-02-08 04:50:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-08 04:50:02,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:02,663 INFO L218 NwaCegarLoop]: trace histogram [20, 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] [2025-02-08 04:50:02,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 04:50:02,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:02,864 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:02,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1067170984, now seen corresponding path program 2 times [2025-02-08 04:50:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822086082] [2025-02-08 04:50:02,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:50:02,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:02,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-02-08 04:50:03,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 82 of 197 statements. [2025-02-08 04:50:03,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:50:03,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 04:50:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:03,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822086082] [2025-02-08 04:50:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822086082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:50:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:50:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 04:50:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061950089] [2025-02-08 04:50:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:50:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 04:50:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:50:03,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 04:50:03,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-08 04:50:03,609 INFO L87 Difference]: Start difference. First operand 829 states and 1086 transitions. Second operand has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:50:05,571 INFO L93 Difference]: Finished difference Result 1432 states and 1912 transitions. [2025-02-08 04:50:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 04:50:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 197 [2025-02-08 04:50:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:50:05,574 INFO L225 Difference]: With dead ends: 1432 [2025-02-08 04:50:05,574 INFO L226 Difference]: Without dead ends: 937 [2025-02-08 04:50:05,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-02-08 04:50:05,575 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 41 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4889 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 04:50:05,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4889 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 04:50:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-08 04:50:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 865. [2025-02-08 04:50:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 853 states have (on average 1.3153575615474795) internal successors, (1122), 857 states have internal predecessors, (1122), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-08 04:50:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1137 transitions. [2025-02-08 04:50:05,599 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1137 transitions. Word has length 197 [2025-02-08 04:50:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:50:05,600 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1137 transitions. [2025-02-08 04:50:05,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:50:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1137 transitions. [2025-02-08 04:50:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-08 04:50:05,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:50:05,601 INFO L218 NwaCegarLoop]: trace histogram [20, 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] [2025-02-08 04:50:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 04:50:05,601 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:50:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:50:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 303626600, now seen corresponding path program 1 times [2025-02-08 04:50:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:50:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562349458] [2025-02-08 04:50:05,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:50:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-08 04:50:05,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 04:50:05,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 2 proven. 197 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 04:50:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:50:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562349458] [2025-02-08 04:50:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562349458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:50:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841121782] [2025-02-08 04:50:06,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:50:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:50:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:50:06,574 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:50:06,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 04:50:07,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-08 04:50:07,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 04:50:07,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:50:07,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:50:07,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 04:50:07,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:50:20,393 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)